/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/const_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:56:16,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:56:16,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:56:16,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:56:16,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:56:16,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:56:16,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:56:16,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:56:16,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:56:16,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:56:16,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:56:16,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:56:16,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:56:16,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:56:16,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:56:16,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:56:16,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:56:16,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:56:16,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:56:16,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:56:16,399 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:56:16,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:56:16,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:56:16,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:56:16,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:56:16,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:56:16,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:56:16,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:56:16,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:56:16,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:56:16,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:56:16,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:56:16,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:56:16,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:56:16,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:56:16,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:56:16,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:56:16,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:56:16,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:56:16,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:56:16,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:56:16,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:56:16,411 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:56:16,416 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:56:16,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:56:16,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:56:16,417 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:56:16,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:56:16,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:56:16,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:56:16,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:56:16,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:56:16,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:56:16,417 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:56:16,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:56:16,418 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:56:16,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:56:16,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:56:16,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:56:16,418 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:56:16,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:56:16,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:56:16,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:56:16,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:56:16,419 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:56:16,419 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:56:16,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:56:16,419 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:56:16,419 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 02:56:16,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:56:16,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:56:16,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:56:16,606 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:56:16,609 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:56:16,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/const_1-2.c [2022-04-28 02:56:16,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7232fd637/07b5222fd9be4c7693ea5ef82da4f9bd/FLAG7349cdcfa [2022-04-28 02:56:16,987 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:56:16,987 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c [2022-04-28 02:56:16,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7232fd637/07b5222fd9be4c7693ea5ef82da4f9bd/FLAG7349cdcfa [2022-04-28 02:56:17,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7232fd637/07b5222fd9be4c7693ea5ef82da4f9bd [2022-04-28 02:56:17,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:56:17,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:56:17,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:56:17,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:56:17,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:56:17,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:56:17" (1/1) ... [2022-04-28 02:56:17,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47530dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:17, skipping insertion in model container [2022-04-28 02:56:17,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:56:17" (1/1) ... [2022-04-28 02:56:17,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:56:17,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:56:17,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c[321,334] [2022-04-28 02:56:17,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:56:17,160 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:56:17,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c[321,334] [2022-04-28 02:56:17,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:56:17,182 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:56:17,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:17 WrapperNode [2022-04-28 02:56:17,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:56:17,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:56:17,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:56:17,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:56:17,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:17" (1/1) ... [2022-04-28 02:56:17,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:17" (1/1) ... [2022-04-28 02:56:17,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:17" (1/1) ... [2022-04-28 02:56:17,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:17" (1/1) ... [2022-04-28 02:56:17,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:17" (1/1) ... [2022-04-28 02:56:17,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:17" (1/1) ... [2022-04-28 02:56:17,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:17" (1/1) ... [2022-04-28 02:56:17,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:56:17,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:56:17,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:56:17,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:56:17,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:17" (1/1) ... [2022-04-28 02:56:17,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:56:17,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:17,231 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-28 02:56:17,250 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-28 02:56:17,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:56:17,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:56:17,264 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:56:17,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:56:17,264 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:56:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:56:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:56:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:56:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:56:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:56:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:56:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:56:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:56:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:56:17,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:56:17,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:56:17,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:56:17,312 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:56:17,313 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:56:17,390 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:56:17,395 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:56:17,395 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:56:17,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:56:17 BoogieIcfgContainer [2022-04-28 02:56:17,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:56:17,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:56:17,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:56:17,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:56:17,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:56:17" (1/3) ... [2022-04-28 02:56:17,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa1740e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:56:17, skipping insertion in model container [2022-04-28 02:56:17,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:17" (2/3) ... [2022-04-28 02:56:17,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa1740e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:56:17, skipping insertion in model container [2022-04-28 02:56:17,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:56:17" (3/3) ... [2022-04-28 02:56:17,423 INFO L111 eAbstractionObserver]: Analyzing ICFG const_1-2.c [2022-04-28 02:56:17,432 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:56:17,432 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:56:17,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:56:17,479 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@4d4e531b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6170b20f [2022-04-28 02:56:17,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:56:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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-28 02:56:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:56:17,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:17,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:17,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:17,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-28 02:56:17,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:17,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1896383386] [2022-04-28 02:56:17,504 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:56:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-28 02:56:17,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:17,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992492834] [2022-04-28 02:56:17,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:17,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:17,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:17,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(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(12, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 02:56:17,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 02:56:17,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-28 02:56:17,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:17,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(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(12, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 02:56:17,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 02:56:17,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-28 02:56:17,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-28 02:56:17,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 1;~y~0 := 0; {21#true} is VALID [2022-04-28 02:56:17,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-28 02:56:17,615 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-28 02:56:17,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-28 02:56:17,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-28 02:56:17,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 02:56:17,615 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-28 02:56:17,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:17,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992492834] [2022-04-28 02:56:17,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992492834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:17,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:17,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:56:17,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:17,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1896383386] [2022-04-28 02:56:17,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1896383386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:17,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:17,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:56:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298602089] [2022-04-28 02:56:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:17,623 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-28 02:56:17,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:17,627 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-28 02:56:17,640 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-28 02:56:17,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:56:17,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:17,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:56:17,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:56:17,656 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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-28 02:56:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:17,706 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 02:56:17,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:56:17,707 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-28 02:56:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:17,708 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-28 02:56:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 02:56:17,712 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-28 02:56:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 02:56:17,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-28 02:56:17,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:17,764 INFO L225 Difference]: With dead ends: 29 [2022-04-28 02:56:17,764 INFO L226 Difference]: Without dead ends: 12 [2022-04-28 02:56:17,766 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-28 02:56:17,769 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 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-28 02:56:17,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-28 02:56:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-28 02:56:17,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:17,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-28 02:56:17,805 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-28 02:56:17,805 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-28 02:56:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:17,806 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-28 02:56:17,806 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 02:56:17,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:17,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:17,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 12 states. [2022-04-28 02:56:17,807 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 12 states. [2022-04-28 02:56:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:17,809 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-28 02:56:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 02:56:17,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:17,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:17,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:17,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-28 02:56:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-28 02:56:17,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-28 02:56:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:17,811 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-28 02:56:17,811 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-28 02:56:17,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-28 02:56:17,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 02:56:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:56:17,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:17,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:17,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:56:17,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:17,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-28 02:56:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:17,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795340971] [2022-04-28 02:56:17,825 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:56:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-28 02:56:17,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:17,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811681853] [2022-04-28 02:56:17,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:17,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:17,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(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(12, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-28 02:56:17,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-28 02:56:17,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-28 02:56:17,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:17,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(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(12, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-28 02:56:17,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-28 02:56:17,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-28 02:56:17,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret5 := main(); {135#true} is VALID [2022-04-28 02:56:17,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 1;~y~0 := 0; {140#(= main_~y~0 0)} is VALID [2022-04-28 02:56:17,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~y~0 0)} assume !(~y~0 % 4294967296 < 1024); {136#false} is VALID [2022-04-28 02:56:17,909 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {136#false} is VALID [2022-04-28 02:56:17,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-28 02:56:17,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-28 02:56:17,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-28 02:56:17,910 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-28 02:56:17,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:17,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811681853] [2022-04-28 02:56:17,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811681853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:17,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:17,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:17,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:17,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795340971] [2022-04-28 02:56:17,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795340971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:17,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:17,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:17,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343517982] [2022-04-28 02:56:17,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:17,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:56:17,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:17,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:17,926 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-28 02:56:17,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:56:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:17,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:56:17,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:56:17,927 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:17,972 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 02:56:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:56:17,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:56:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-28 02:56:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-28 02:56:17,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-28 02:56:18,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:18,005 INFO L225 Difference]: With dead ends: 18 [2022-04-28 02:56:18,005 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 02:56:18,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 02:56:18,006 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:18,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:18,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 02:56:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 02:56:18,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:18,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 02:56:18,010 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 02:56:18,010 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 02:56:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:18,013 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 02:56:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 02:56:18,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:18,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:18,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-28 02:56:18,014 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-28 02:56:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:18,015 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 02:56:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 02:56:18,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:18,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:18,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:18,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 02:56:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 02:56:18,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 02:56:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:18,017 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 02:56:18,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:18,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 02:56:18,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 02:56:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 02:56:18,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:18,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:18,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:56:18,035 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-28 02:56:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:18,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1424450413] [2022-04-28 02:56:20,745 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:56:20,973 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:20,976 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:20,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1867307785, now seen corresponding path program 1 times [2022-04-28 02:56:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:20,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442457102] [2022-04-28 02:56:20,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:20,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:21,000 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:21,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-28 02:56:21,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:21,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458372427] [2022-04-28 02:56:21,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:21,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:21,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:21,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#(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(12, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-28 02:56:21,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 02:56:21,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 02:56:21,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:21,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#(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(12, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-28 02:56:21,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 02:56:21,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 02:56:21,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-28 02:56:21,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 1;~y~0 := 0; {239#(= main_~y~0 0)} is VALID [2022-04-28 02:56:21,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {240#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:21,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 1))} assume !(~y~0 % 4294967296 < 1024); {235#false} is VALID [2022-04-28 02:56:21,075 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {235#false} is VALID [2022-04-28 02:56:21,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 02:56:21,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 02:56:21,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 02:56:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:21,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:21,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458372427] [2022-04-28 02:56:21,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458372427] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:21,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884651580] [2022-04-28 02:56:21,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:21,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:21,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:21,078 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-28 02:56:21,082 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-28 02:56:21,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:21,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:21,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 02:56:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:21,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:21,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-28 02:56:21,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#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(12, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-28 02:56:21,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 02:56:21,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 02:56:21,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-28 02:56:21,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 1;~y~0 := 0; {239#(= main_~y~0 0)} is VALID [2022-04-28 02:56:21,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {263#(= main_~y~0 1)} is VALID [2022-04-28 02:56:21,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(= main_~y~0 1)} assume !(~y~0 % 4294967296 < 1024); {235#false} is VALID [2022-04-28 02:56:21,149 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {235#false} is VALID [2022-04-28 02:56:21,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 02:56:21,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 02:56:21,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 02:56:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:21,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:21,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 02:56:21,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 02:56:21,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 02:56:21,199 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {235#false} is VALID [2022-04-28 02:56:21,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {235#false} is VALID [2022-04-28 02:56:21,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {291#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:21,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 1;~y~0 := 0; {295#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:21,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-28 02:56:21,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 02:56:21,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 02:56:21,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#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(12, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-28 02:56:21,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-28 02:56:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:21,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884651580] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:21,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:21,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 02:56:21,203 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:21,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1424450413] [2022-04-28 02:56:21,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1424450413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:21,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:21,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:56:21,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055526831] [2022-04-28 02:56:21,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:21,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-28 02:56:21,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:21,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-28 02:56:21,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:21,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:56:21,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:21,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:56:21,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:56:21,213 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-28 02:56:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:21,257 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 02:56:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:56:21,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-28 02:56:21,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-28 02:56:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 02:56:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-28 02:56:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 02:56:21,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-28 02:56:21,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:21,274 INFO L225 Difference]: With dead ends: 19 [2022-04-28 02:56:21,274 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 02:56:21,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:56:21,275 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:21,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:21,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 02:56:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 02:56:21,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:21,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-28 02:56:21,279 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-28 02:56:21,279 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-28 02:56:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:21,280 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 02:56:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 02:56:21,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:21,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:21,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-28 02:56:21,281 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-28 02:56:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:21,281 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 02:56:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 02:56:21,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:21,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:21,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:21,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-28 02:56:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 02:56:21,283 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 02:56:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:21,283 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 02:56:21,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-28 02:56:21,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 02:56:21,294 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-28 02:56:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 02:56:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 02:56:21,295 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:21,295 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:21,315 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-28 02:56:21,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:21,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:21,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-28 02:56:21,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:21,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [881179724] [2022-04-28 02:56:24,123 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:24,124 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1808202441, now seen corresponding path program 1 times [2022-04-28 02:56:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:24,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953570632] [2022-04-28 02:56:24,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:24,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:24,139 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:24,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-28 02:56:24,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:24,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676122790] [2022-04-28 02:56:24,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:24,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:24,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:24,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#(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(12, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 02:56:24,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 02:56:24,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 02:56:24,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:24,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#(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(12, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 02:56:24,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 02:56:24,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 02:56:24,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret5 := main(); {414#true} is VALID [2022-04-28 02:56:24,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 1;~y~0 := 0; {419#(= main_~y~0 0)} is VALID [2022-04-28 02:56:24,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {420#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:24,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {421#(and (<= main_~y~0 2) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:56:24,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {421#(and (<= main_~y~0 2) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {415#false} is VALID [2022-04-28 02:56:24,213 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {415#false} is VALID [2022-04-28 02:56:24,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-28 02:56:24,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-28 02:56:24,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 02:56:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:24,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:24,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676122790] [2022-04-28 02:56:24,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676122790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:24,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577908199] [2022-04-28 02:56:24,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:24,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:24,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:24,217 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-28 02:56:24,218 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-28 02:56:24,242 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:24,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:24,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 02:56:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:24,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:24,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2022-04-28 02:56:24,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#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(12, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 02:56:24,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 02:56:24,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 02:56:24,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret5 := main(); {414#true} is VALID [2022-04-28 02:56:24,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 1;~y~0 := 0; {419#(= main_~y~0 0)} is VALID [2022-04-28 02:56:24,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {420#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:24,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {447#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:24,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {447#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~y~0 % 4294967296 < 1024); {415#false} is VALID [2022-04-28 02:56:24,375 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {415#false} is VALID [2022-04-28 02:56:24,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-28 02:56:24,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-28 02:56:24,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 02:56:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:24,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:24,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 02:56:24,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-28 02:56:24,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-28 02:56:24,438 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {415#false} is VALID [2022-04-28 02:56:24,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {415#false} is VALID [2022-04-28 02:56:24,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {479#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {475#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:24,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {479#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:24,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 1;~y~0 := 0; {483#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:56:24,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret5 := main(); {414#true} is VALID [2022-04-28 02:56:24,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 02:56:24,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 02:56:24,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#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(12, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 02:56:24,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2022-04-28 02:56:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:24,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577908199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:24,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:24,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 02:56:24,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:24,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [881179724] [2022-04-28 02:56:24,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [881179724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:24,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:24,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:56:24,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377275395] [2022-04-28 02:56:24,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:24,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-28 02:56:24,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:24,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-28 02:56:24,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:24,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:56:24,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:56:24,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:56:24,454 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-28 02:56:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:24,532 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 02:56:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:56:24,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-28 02:56:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-28 02:56:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 02:56:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-28 02:56:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 02:56:24,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-28 02:56:24,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:24,551 INFO L225 Difference]: With dead ends: 20 [2022-04-28 02:56:24,551 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 02:56:24,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-28 02:56:24,553 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:24,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:24,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 02:56:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 02:56:24,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:24,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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-28 02:56:24,558 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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-28 02:56:24,558 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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-28 02:56:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:24,559 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 02:56:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:56:24,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:24,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:24,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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 15 states. [2022-04-28 02:56:24,560 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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 15 states. [2022-04-28 02:56:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:24,561 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 02:56:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:56:24,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:24,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:24,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:24,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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-28 02:56:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 02:56:24,562 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 02:56:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:24,562 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 02:56:24,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-28 02:56:24,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 02:56:24,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:56:24,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 02:56:24,574 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:24,574 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:24,590 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-28 02:56:24,787 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,SelfDestructingSolverStorable5 [2022-04-28 02:56:24,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-28 02:56:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:24,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1764869327] [2022-04-28 02:56:27,275 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:27,276 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1749097097, now seen corresponding path program 1 times [2022-04-28 02:56:27,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:27,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530336424] [2022-04-28 02:56:27,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:27,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:27,291 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:27,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-28 02:56:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:27,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126255239] [2022-04-28 02:56:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:27,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:27,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#(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(12, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 02:56:27,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 02:56:27,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 02:56:27,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:27,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#(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(12, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 02:56:27,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 02:56:27,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 02:56:27,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2022-04-28 02:56:27,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 1;~y~0 := 0; {615#(= main_~y~0 0)} is VALID [2022-04-28 02:56:27,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {615#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {616#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:27,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {617#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:27,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {618#(and (<= main_~y~0 3) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:56:27,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {618#(and (<= main_~y~0 3) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {611#false} is VALID [2022-04-28 02:56:27,406 INFO L272 TraceCheckUtils]: 10: Hoare triple {611#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {611#false} is VALID [2022-04-28 02:56:27,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2022-04-28 02:56:27,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2022-04-28 02:56:27,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 02:56:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:27,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126255239] [2022-04-28 02:56:27,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126255239] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:27,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737553442] [2022-04-28 02:56:27,407 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:27,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:27,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:27,412 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-28 02:56:27,413 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-28 02:56:27,440 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 02:56:27,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:27,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 02:56:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:27,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:27,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-28 02:56:27,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#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(12, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 02:56:27,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 02:56:27,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 02:56:27,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2022-04-28 02:56:27,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 1;~y~0 := 0; {615#(= main_~y~0 0)} is VALID [2022-04-28 02:56:27,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {615#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {616#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:27,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {617#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:27,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {647#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:27,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {647#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {611#false} is VALID [2022-04-28 02:56:27,590 INFO L272 TraceCheckUtils]: 10: Hoare triple {611#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {611#false} is VALID [2022-04-28 02:56:27,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2022-04-28 02:56:27,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2022-04-28 02:56:27,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 02:56:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:27,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:27,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 02:56:27,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2022-04-28 02:56:27,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2022-04-28 02:56:27,668 INFO L272 TraceCheckUtils]: 10: Hoare triple {611#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {611#false} is VALID [2022-04-28 02:56:27,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {675#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {611#false} is VALID [2022-04-28 02:56:27,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {675#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:27,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {679#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:27,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {687#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {683#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:56:27,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 1;~y~0 := 0; {687#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:56:27,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2022-04-28 02:56:27,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 02:56:27,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 02:56:27,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#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(12, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 02:56:27,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-28 02:56:27,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:27,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737553442] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:27,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:27,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 02:56:27,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:27,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1764869327] [2022-04-28 02:56:27,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1764869327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:27,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:27,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:56:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987762479] [2022-04-28 02:56:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:27,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 02:56:27,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:27,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 02:56:27,687 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-28 02:56:27,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:56:27,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:27,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:56:27,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:56:27,688 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 02:56:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:27,811 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 02:56:27,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:56:27,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 02:56:27,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 02:56:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 02:56:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 02:56:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 02:56:27,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-28 02:56:27,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:27,837 INFO L225 Difference]: With dead ends: 21 [2022-04-28 02:56:27,837 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 02:56:27,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:56:27,838 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:27,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 02:56:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 02:56:27,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:27,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-28 02:56:27,857 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-28 02:56:27,858 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-28 02:56:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:27,862 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 02:56:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 02:56:27,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:27,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:27,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 16 states. [2022-04-28 02:56:27,863 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 16 states. [2022-04-28 02:56:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:27,865 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 02:56:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 02:56:27,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:27,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:27,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:27,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-28 02:56:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 02:56:27,870 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 02:56:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:27,870 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 02:56:27,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-28 02:56:27,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 02:56:27,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 02:56:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:56:27,882 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:27,882 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:27,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:28,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:28,099 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-28 02:56:28,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:28,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [269556989] [2022-04-28 02:56:28,548 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:28,550 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1689991753, now seen corresponding path program 1 times [2022-04-28 02:56:28,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:28,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649761325] [2022-04-28 02:56:28,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:28,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:28,561 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:28,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-28 02:56:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:28,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190259034] [2022-04-28 02:56:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:28,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:28,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {832#(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(12, 2);call #Ultimate.allocInit(12, 3); {822#true} is VALID [2022-04-28 02:56:28,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 02:56:28,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #34#return; {822#true} is VALID [2022-04-28 02:56:28,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {832#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:28,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {832#(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(12, 2);call #Ultimate.allocInit(12, 3); {822#true} is VALID [2022-04-28 02:56:28,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 02:56:28,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #34#return; {822#true} is VALID [2022-04-28 02:56:28,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-28 02:56:28,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} ~x~0 := 1;~y~0 := 0; {827#(= main_~y~0 0)} is VALID [2022-04-28 02:56:28,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {827#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:28,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:28,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:28,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {831#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 4))} is VALID [2022-04-28 02:56:28,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {831#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 4))} assume !(~y~0 % 4294967296 < 1024); {823#false} is VALID [2022-04-28 02:56:28,660 INFO L272 TraceCheckUtils]: 11: Hoare triple {823#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {823#false} is VALID [2022-04-28 02:56:28,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {823#false} ~cond := #in~cond; {823#false} is VALID [2022-04-28 02:56:28,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {823#false} assume 0 == ~cond; {823#false} is VALID [2022-04-28 02:56:28,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-28 02:56:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:28,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:28,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190259034] [2022-04-28 02:56:28,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190259034] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:28,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212332753] [2022-04-28 02:56:28,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:28,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:28,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:28,663 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-28 02:56:28,664 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-28 02:56:28,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:28,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:28,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 02:56:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:28,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:28,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-28 02:56:28,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#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(12, 2);call #Ultimate.allocInit(12, 3); {822#true} is VALID [2022-04-28 02:56:28,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 02:56:28,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #34#return; {822#true} is VALID [2022-04-28 02:56:28,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-28 02:56:28,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} ~x~0 := 1;~y~0 := 0; {827#(= main_~y~0 0)} is VALID [2022-04-28 02:56:28,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {827#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:28,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:28,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:28,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {863#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:28,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {863#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {823#false} is VALID [2022-04-28 02:56:28,857 INFO L272 TraceCheckUtils]: 11: Hoare triple {823#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {823#false} is VALID [2022-04-28 02:56:28,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {823#false} ~cond := #in~cond; {823#false} is VALID [2022-04-28 02:56:28,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {823#false} assume 0 == ~cond; {823#false} is VALID [2022-04-28 02:56:28,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-28 02:56:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:28,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:28,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-28 02:56:28,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {823#false} assume 0 == ~cond; {823#false} is VALID [2022-04-28 02:56:28,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {823#false} ~cond := #in~cond; {823#false} is VALID [2022-04-28 02:56:28,958 INFO L272 TraceCheckUtils]: 11: Hoare triple {823#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {823#false} is VALID [2022-04-28 02:56:28,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {891#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {823#false} is VALID [2022-04-28 02:56:28,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {891#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:28,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {899#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {895#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:28,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {903#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {899#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:56:28,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {903#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:56:28,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} ~x~0 := 1;~y~0 := 0; {907#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:56:28,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-28 02:56:28,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #34#return; {822#true} is VALID [2022-04-28 02:56:28,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 02:56:28,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#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(12, 2);call #Ultimate.allocInit(12, 3); {822#true} is VALID [2022-04-28 02:56:28,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-28 02:56:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:28,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212332753] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:28,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:28,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 02:56:28,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:28,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [269556989] [2022-04-28 02:56:28,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [269556989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:28,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:28,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:56:28,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641864525] [2022-04-28 02:56:28,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:28,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 15 [2022-04-28 02:56:28,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:28,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-28 02:56:28,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:28,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:56:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:28,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:56:28,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-28 02:56:28,979 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-28 02:56:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:29,126 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 02:56:29,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:56:29,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 15 [2022-04-28 02:56:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-28 02:56:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 02:56:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-28 02:56:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 02:56:29,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-28 02:56:29,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:29,144 INFO L225 Difference]: With dead ends: 22 [2022-04-28 02:56:29,144 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 02:56:29,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-04-28 02:56:29,159 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:29,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 02:56:29,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 02:56:29,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:29,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:29,168 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:29,168 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:29,169 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 02:56:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 02:56:29,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:29,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:29,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 02:56:29,170 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 02:56:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:29,170 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 02:56:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 02:56:29,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:29,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:29,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:29,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 02:56:29,171 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-28 02:56:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:29,171 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 02:56:29,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-28 02:56:29,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 02:56:29,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 02:56:29,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 02:56:29,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:29,185 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:29,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:29,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:29,399 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:29,400 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-28 02:56:29,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:29,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553031748] [2022-04-28 02:56:29,731 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:29,732 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1630886409, now seen corresponding path program 1 times [2022-04-28 02:56:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:29,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975159183] [2022-04-28 02:56:29,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:29,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:29,743 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:29,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:29,749 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-28 02:56:29,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:29,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070642645] [2022-04-28 02:56:29,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:29,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:29,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:29,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#(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(12, 2);call #Ultimate.allocInit(12, 3); {1050#true} is VALID [2022-04-28 02:56:29,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {1050#true} assume true; {1050#true} is VALID [2022-04-28 02:56:29,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1050#true} {1050#true} #34#return; {1050#true} is VALID [2022-04-28 02:56:29,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {1050#true} call ULTIMATE.init(); {1061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:29,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#(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(12, 2);call #Ultimate.allocInit(12, 3); {1050#true} is VALID [2022-04-28 02:56:29,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {1050#true} assume true; {1050#true} is VALID [2022-04-28 02:56:29,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1050#true} {1050#true} #34#return; {1050#true} is VALID [2022-04-28 02:56:29,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {1050#true} call #t~ret5 := main(); {1050#true} is VALID [2022-04-28 02:56:29,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {1050#true} ~x~0 := 1;~y~0 := 0; {1055#(= main_~y~0 0)} is VALID [2022-04-28 02:56:29,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {1055#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1056#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:29,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {1056#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1057#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:29,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {1057#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1058#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:29,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {1058#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1059#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:29,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {1059#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1060#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:29,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {1060#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 5))} assume !(~y~0 % 4294967296 < 1024); {1051#false} is VALID [2022-04-28 02:56:29,839 INFO L272 TraceCheckUtils]: 12: Hoare triple {1051#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1051#false} is VALID [2022-04-28 02:56:29,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {1051#false} ~cond := #in~cond; {1051#false} is VALID [2022-04-28 02:56:29,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {1051#false} assume 0 == ~cond; {1051#false} is VALID [2022-04-28 02:56:29,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {1051#false} assume !false; {1051#false} is VALID [2022-04-28 02:56:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:29,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:29,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070642645] [2022-04-28 02:56:29,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070642645] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:29,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501221318] [2022-04-28 02:56:29,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:29,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:29,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:29,852 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-28 02:56:29,853 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-28 02:56:29,888 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:29,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:29,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 02:56:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:29,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:30,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {1050#true} call ULTIMATE.init(); {1050#true} is VALID [2022-04-28 02:56:30,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {1050#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(12, 2);call #Ultimate.allocInit(12, 3); {1050#true} is VALID [2022-04-28 02:56:30,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {1050#true} assume true; {1050#true} is VALID [2022-04-28 02:56:30,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1050#true} {1050#true} #34#return; {1050#true} is VALID [2022-04-28 02:56:30,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {1050#true} call #t~ret5 := main(); {1050#true} is VALID [2022-04-28 02:56:30,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {1050#true} ~x~0 := 1;~y~0 := 0; {1055#(= main_~y~0 0)} is VALID [2022-04-28 02:56:30,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {1055#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1056#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:30,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {1056#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1057#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:30,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {1057#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1058#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:30,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {1058#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1059#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:30,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {1059#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1095#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:30,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {1095#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~y~0 % 4294967296 < 1024); {1051#false} is VALID [2022-04-28 02:56:30,052 INFO L272 TraceCheckUtils]: 12: Hoare triple {1051#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1051#false} is VALID [2022-04-28 02:56:30,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {1051#false} ~cond := #in~cond; {1051#false} is VALID [2022-04-28 02:56:30,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {1051#false} assume 0 == ~cond; {1051#false} is VALID [2022-04-28 02:56:30,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {1051#false} assume !false; {1051#false} is VALID [2022-04-28 02:56:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:30,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:30,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {1051#false} assume !false; {1051#false} is VALID [2022-04-28 02:56:30,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {1051#false} assume 0 == ~cond; {1051#false} is VALID [2022-04-28 02:56:30,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {1051#false} ~cond := #in~cond; {1051#false} is VALID [2022-04-28 02:56:30,173 INFO L272 TraceCheckUtils]: 12: Hoare triple {1051#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1051#false} is VALID [2022-04-28 02:56:30,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {1123#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {1051#false} is VALID [2022-04-28 02:56:30,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {1127#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1123#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:30,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {1131#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1127#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:30,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {1135#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1131#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:56:30,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {1139#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1135#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:56:30,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {1143#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1139#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:56:30,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {1050#true} ~x~0 := 1;~y~0 := 0; {1143#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:30,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {1050#true} call #t~ret5 := main(); {1050#true} is VALID [2022-04-28 02:56:30,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1050#true} {1050#true} #34#return; {1050#true} is VALID [2022-04-28 02:56:30,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {1050#true} assume true; {1050#true} is VALID [2022-04-28 02:56:30,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {1050#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(12, 2);call #Ultimate.allocInit(12, 3); {1050#true} is VALID [2022-04-28 02:56:30,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {1050#true} call ULTIMATE.init(); {1050#true} is VALID [2022-04-28 02:56:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:30,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501221318] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:30,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:30,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 02:56:30,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:30,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553031748] [2022-04-28 02:56:30,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553031748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:30,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:30,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:56:30,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921184582] [2022-04-28 02:56:30,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:30,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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 16 [2022-04-28 02:56:30,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:30,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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-28 02:56:30,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:30,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:56:30,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:30,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:56:30,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:56:30,205 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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-28 02:56:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:30,382 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 02:56:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:56:30,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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 16 [2022-04-28 02:56:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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-28 02:56:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 02:56:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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-28 02:56:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 02:56:30,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-28 02:56:30,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:30,410 INFO L225 Difference]: With dead ends: 23 [2022-04-28 02:56:30,410 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 02:56:30,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2022-04-28 02:56:30,411 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:30,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 02:56:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 02:56:30,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:30,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-28 02:56:30,420 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-28 02:56:30,420 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-28 02:56:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:30,421 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 02:56:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 02:56:30,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:30,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:30,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 18 states. [2022-04-28 02:56:30,421 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 18 states. [2022-04-28 02:56:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:30,422 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 02:56:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 02:56:30,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:30,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:30,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:30,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-28 02:56:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 02:56:30,423 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-28 02:56:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:30,423 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 02:56:30,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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-28 02:56:30,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 02:56:30,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 02:56:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 02:56:30,437 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:30,437 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:30,456 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-28 02:56:30,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2022-04-28 02:56:30,656 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-28 02:56:30,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:30,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [923598244] [2022-04-28 02:56:32,160 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:32,162 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:32,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1571781065, now seen corresponding path program 1 times [2022-04-28 02:56:32,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:32,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578671039] [2022-04-28 02:56:32,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:32,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:32,171 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:32,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-28 02:56:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:32,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559312385] [2022-04-28 02:56:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:32,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:32,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:32,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#(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(12, 2);call #Ultimate.allocInit(12, 3); {1294#true} is VALID [2022-04-28 02:56:32,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {1294#true} assume true; {1294#true} is VALID [2022-04-28 02:56:32,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1294#true} {1294#true} #34#return; {1294#true} is VALID [2022-04-28 02:56:32,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {1294#true} call ULTIMATE.init(); {1306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:32,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#(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(12, 2);call #Ultimate.allocInit(12, 3); {1294#true} is VALID [2022-04-28 02:56:32,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {1294#true} assume true; {1294#true} is VALID [2022-04-28 02:56:32,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1294#true} {1294#true} #34#return; {1294#true} is VALID [2022-04-28 02:56:32,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {1294#true} call #t~ret5 := main(); {1294#true} is VALID [2022-04-28 02:56:32,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {1294#true} ~x~0 := 1;~y~0 := 0; {1299#(= main_~y~0 0)} is VALID [2022-04-28 02:56:32,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {1299#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:32,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {1300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:32,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {1301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:32,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {1302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:32,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {1303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:32,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {1304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1305#(and (<= main_~y~0 6) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:56:32,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {1305#(and (<= main_~y~0 6) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {1295#false} is VALID [2022-04-28 02:56:32,279 INFO L272 TraceCheckUtils]: 13: Hoare triple {1295#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1295#false} is VALID [2022-04-28 02:56:32,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {1295#false} ~cond := #in~cond; {1295#false} is VALID [2022-04-28 02:56:32,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {1295#false} assume 0 == ~cond; {1295#false} is VALID [2022-04-28 02:56:32,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {1295#false} assume !false; {1295#false} is VALID [2022-04-28 02:56:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:32,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:32,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559312385] [2022-04-28 02:56:32,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559312385] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:32,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671566982] [2022-04-28 02:56:32,280 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:32,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:32,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:32,281 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-28 02:56:32,282 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-28 02:56:32,311 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 02:56:32,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:32,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 02:56:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:32,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:32,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {1294#true} call ULTIMATE.init(); {1294#true} is VALID [2022-04-28 02:56:32,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1294#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(12, 2);call #Ultimate.allocInit(12, 3); {1294#true} is VALID [2022-04-28 02:56:32,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {1294#true} assume true; {1294#true} is VALID [2022-04-28 02:56:32,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1294#true} {1294#true} #34#return; {1294#true} is VALID [2022-04-28 02:56:32,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {1294#true} call #t~ret5 := main(); {1294#true} is VALID [2022-04-28 02:56:32,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {1294#true} ~x~0 := 1;~y~0 := 0; {1299#(= main_~y~0 0)} is VALID [2022-04-28 02:56:32,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {1299#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:32,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {1300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:32,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {1301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:32,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {1302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:32,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {1303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:32,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {1304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1343#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:32,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {1343#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {1295#false} is VALID [2022-04-28 02:56:32,491 INFO L272 TraceCheckUtils]: 13: Hoare triple {1295#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1295#false} is VALID [2022-04-28 02:56:32,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {1295#false} ~cond := #in~cond; {1295#false} is VALID [2022-04-28 02:56:32,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {1295#false} assume 0 == ~cond; {1295#false} is VALID [2022-04-28 02:56:32,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {1295#false} assume !false; {1295#false} is VALID [2022-04-28 02:56:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:32,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:32,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {1295#false} assume !false; {1295#false} is VALID [2022-04-28 02:56:32,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {1295#false} assume 0 == ~cond; {1295#false} is VALID [2022-04-28 02:56:32,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {1295#false} ~cond := #in~cond; {1295#false} is VALID [2022-04-28 02:56:32,621 INFO L272 TraceCheckUtils]: 13: Hoare triple {1295#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1295#false} is VALID [2022-04-28 02:56:32,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {1371#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {1295#false} is VALID [2022-04-28 02:56:32,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {1375#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1371#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:32,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {1379#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1375#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:32,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {1383#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1379#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:56:32,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {1387#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1383#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:56:32,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {1391#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1387#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:56:32,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {1395#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1391#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:32,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {1294#true} ~x~0 := 1;~y~0 := 0; {1395#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:56:32,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {1294#true} call #t~ret5 := main(); {1294#true} is VALID [2022-04-28 02:56:32,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1294#true} {1294#true} #34#return; {1294#true} is VALID [2022-04-28 02:56:32,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {1294#true} assume true; {1294#true} is VALID [2022-04-28 02:56:32,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {1294#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(12, 2);call #Ultimate.allocInit(12, 3); {1294#true} is VALID [2022-04-28 02:56:32,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {1294#true} call ULTIMATE.init(); {1294#true} is VALID [2022-04-28 02:56:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:32,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671566982] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:32,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:32,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 02:56:32,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:32,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [923598244] [2022-04-28 02:56:32,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [923598244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:32,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:32,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 02:56:32,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270579820] [2022-04-28 02:56:32,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:32,627 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 17 [2022-04-28 02:56:32,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:32,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-28 02:56:32,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:32,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 02:56:32,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:32,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 02:56:32,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-04-28 02:56:32,639 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-28 02:56:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:32,838 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 02:56:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:56:32,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 17 [2022-04-28 02:56:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-28 02:56:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 02:56:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-28 02:56:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 02:56:32,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-28 02:56:32,855 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-28 02:56:32,855 INFO L225 Difference]: With dead ends: 24 [2022-04-28 02:56:32,855 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 02:56:32,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2022-04-28 02:56:32,856 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:32,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:32,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 02:56:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 02:56:32,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:32,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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-28 02:56:32,866 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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-28 02:56:32,866 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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-28 02:56:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:32,867 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 02:56:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 02:56:32,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:32,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:32,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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 19 states. [2022-04-28 02:56:32,867 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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 19 states. [2022-04-28 02:56:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:32,868 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 02:56:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 02:56:32,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:32,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:32,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:32,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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-28 02:56:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 02:56:32,869 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-28 02:56:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:32,869 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 02:56:32,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-28 02:56:32,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 02:56:32,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:32,888 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 02:56:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 02:56:32,888 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:32,888 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:32,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:33,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:33,092 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:33,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:33,092 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 13 times [2022-04-28 02:56:33,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:33,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1215255536] [2022-04-28 02:56:35,682 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:56:35,827 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:35,829 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:35,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1512675721, now seen corresponding path program 1 times [2022-04-28 02:56:35,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:35,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875724000] [2022-04-28 02:56:35,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:35,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:35,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:35,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 14 times [2022-04-28 02:56:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:35,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079237555] [2022-04-28 02:56:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:35,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:35,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {1567#(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(12, 2);call #Ultimate.allocInit(12, 3); {1554#true} is VALID [2022-04-28 02:56:35,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {1554#true} assume true; {1554#true} is VALID [2022-04-28 02:56:35,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1554#true} {1554#true} #34#return; {1554#true} is VALID [2022-04-28 02:56:35,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {1554#true} call ULTIMATE.init(); {1567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:35,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {1567#(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(12, 2);call #Ultimate.allocInit(12, 3); {1554#true} is VALID [2022-04-28 02:56:35,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {1554#true} assume true; {1554#true} is VALID [2022-04-28 02:56:35,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1554#true} {1554#true} #34#return; {1554#true} is VALID [2022-04-28 02:56:35,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {1554#true} call #t~ret5 := main(); {1554#true} is VALID [2022-04-28 02:56:35,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {1554#true} ~x~0 := 1;~y~0 := 0; {1559#(= main_~y~0 0)} is VALID [2022-04-28 02:56:35,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {1559#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1560#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:35,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1561#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:35,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {1561#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1562#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:35,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {1562#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1563#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:35,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {1563#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1564#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:35,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {1564#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1565#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:35,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {1565#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1566#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:35,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 7))} assume !(~y~0 % 4294967296 < 1024); {1555#false} is VALID [2022-04-28 02:56:35,954 INFO L272 TraceCheckUtils]: 14: Hoare triple {1555#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1555#false} is VALID [2022-04-28 02:56:35,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {1555#false} ~cond := #in~cond; {1555#false} is VALID [2022-04-28 02:56:35,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {1555#false} assume 0 == ~cond; {1555#false} is VALID [2022-04-28 02:56:35,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {1555#false} assume !false; {1555#false} is VALID [2022-04-28 02:56:35,954 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:35,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:35,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079237555] [2022-04-28 02:56:35,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079237555] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:35,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350016094] [2022-04-28 02:56:35,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:35,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:35,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:35,955 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:35,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 02:56:35,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:35,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:35,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 02:56:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:35,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:36,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {1554#true} call ULTIMATE.init(); {1554#true} is VALID [2022-04-28 02:56:36,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {1554#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(12, 2);call #Ultimate.allocInit(12, 3); {1554#true} is VALID [2022-04-28 02:56:36,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {1554#true} assume true; {1554#true} is VALID [2022-04-28 02:56:36,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1554#true} {1554#true} #34#return; {1554#true} is VALID [2022-04-28 02:56:36,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {1554#true} call #t~ret5 := main(); {1554#true} is VALID [2022-04-28 02:56:36,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {1554#true} ~x~0 := 1;~y~0 := 0; {1559#(= main_~y~0 0)} is VALID [2022-04-28 02:56:36,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {1559#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1560#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:36,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1561#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:36,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {1561#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1562#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:36,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {1562#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1563#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:36,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {1563#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1564#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:36,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {1564#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1565#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:36,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {1565#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:36,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {1607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~y~0 % 4294967296 < 1024); {1555#false} is VALID [2022-04-28 02:56:36,185 INFO L272 TraceCheckUtils]: 14: Hoare triple {1555#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1555#false} is VALID [2022-04-28 02:56:36,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {1555#false} ~cond := #in~cond; {1555#false} is VALID [2022-04-28 02:56:36,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {1555#false} assume 0 == ~cond; {1555#false} is VALID [2022-04-28 02:56:36,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {1555#false} assume !false; {1555#false} is VALID [2022-04-28 02:56:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:36,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:36,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {1555#false} assume !false; {1555#false} is VALID [2022-04-28 02:56:36,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {1555#false} assume 0 == ~cond; {1555#false} is VALID [2022-04-28 02:56:36,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {1555#false} ~cond := #in~cond; {1555#false} is VALID [2022-04-28 02:56:36,350 INFO L272 TraceCheckUtils]: 14: Hoare triple {1555#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1555#false} is VALID [2022-04-28 02:56:36,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {1635#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {1555#false} is VALID [2022-04-28 02:56:36,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {1639#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1635#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:36,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {1643#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1639#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:36,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {1647#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1643#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:56:36,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {1651#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1647#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:56:36,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {1655#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1651#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:56:36,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {1659#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1655#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:36,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {1663#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1659#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:56:36,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {1554#true} ~x~0 := 1;~y~0 := 0; {1663#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:36,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {1554#true} call #t~ret5 := main(); {1554#true} is VALID [2022-04-28 02:56:36,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1554#true} {1554#true} #34#return; {1554#true} is VALID [2022-04-28 02:56:36,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {1554#true} assume true; {1554#true} is VALID [2022-04-28 02:56:36,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {1554#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(12, 2);call #Ultimate.allocInit(12, 3); {1554#true} is VALID [2022-04-28 02:56:36,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {1554#true} call ULTIMATE.init(); {1554#true} is VALID [2022-04-28 02:56:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:36,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350016094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:36,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:36,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 02:56:36,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:36,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1215255536] [2022-04-28 02:56:36,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1215255536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:36,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:36,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 02:56:36,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044808738] [2022-04-28 02:56:36,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:36,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 18 [2022-04-28 02:56:36,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:36,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-28 02:56:36,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:36,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 02:56:36,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:36,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 02:56:36,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-04-28 02:56:36,372 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-28 02:56:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:36,629 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 02:56:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 02:56:36,629 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 18 [2022-04-28 02:56:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-28 02:56:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-28 02:56:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-28 02:56:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-28 02:56:36,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2022-04-28 02:56:36,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:36,664 INFO L225 Difference]: With dead ends: 25 [2022-04-28 02:56:36,664 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 02:56:36,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2022-04-28 02:56:36,665 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:36,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 02:56:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 02:56:36,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:36,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-28 02:56:36,676 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-28 02:56:36,676 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-28 02:56:36,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:36,677 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 02:56:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 02:56:36,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:36,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:36,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-28 02:56:36,677 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-28 02:56:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:36,678 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 02:56:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 02:56:36,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:36,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:36,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:36,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-28 02:56:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-28 02:56:36,679 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-28 02:56:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:36,679 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-28 02:56:36,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-28 02:56:36,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-28 02:56:36,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 02:56:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 02:56:36,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:36,694 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:36,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:36,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:36,894 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:36,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 15 times [2022-04-28 02:56:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:36,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [572345732] [2022-04-28 02:56:39,523 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:39,524 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1453570377, now seen corresponding path program 1 times [2022-04-28 02:56:39,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:39,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288684311] [2022-04-28 02:56:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:39,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:39,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:39,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:39,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 16 times [2022-04-28 02:56:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:39,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050464834] [2022-04-28 02:56:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:39,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:39,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:39,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {1844#(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(12, 2);call #Ultimate.allocInit(12, 3); {1830#true} is VALID [2022-04-28 02:56:39,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {1830#true} assume true; {1830#true} is VALID [2022-04-28 02:56:39,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1830#true} {1830#true} #34#return; {1830#true} is VALID [2022-04-28 02:56:39,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {1830#true} call ULTIMATE.init(); {1844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:39,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1844#(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(12, 2);call #Ultimate.allocInit(12, 3); {1830#true} is VALID [2022-04-28 02:56:39,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1830#true} assume true; {1830#true} is VALID [2022-04-28 02:56:39,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1830#true} {1830#true} #34#return; {1830#true} is VALID [2022-04-28 02:56:39,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {1830#true} call #t~ret5 := main(); {1830#true} is VALID [2022-04-28 02:56:39,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {1830#true} ~x~0 := 1;~y~0 := 0; {1835#(= main_~y~0 0)} is VALID [2022-04-28 02:56:39,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {1835#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:39,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {1836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:39,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {1837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:39,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {1838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:39,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {1839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:39,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {1840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:39,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {1841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:39,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {1842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1843#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 8))} is VALID [2022-04-28 02:56:39,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {1843#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 8))} assume !(~y~0 % 4294967296 < 1024); {1831#false} is VALID [2022-04-28 02:56:39,697 INFO L272 TraceCheckUtils]: 15: Hoare triple {1831#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1831#false} is VALID [2022-04-28 02:56:39,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {1831#false} ~cond := #in~cond; {1831#false} is VALID [2022-04-28 02:56:39,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {1831#false} assume 0 == ~cond; {1831#false} is VALID [2022-04-28 02:56:39,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {1831#false} assume !false; {1831#false} is VALID [2022-04-28 02:56:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:39,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:39,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050464834] [2022-04-28 02:56:39,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050464834] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:39,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791048040] [2022-04-28 02:56:39,697 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:39,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:39,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:39,698 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:39,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 02:56:39,726 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:39,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:39,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 02:56:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:39,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:39,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {1830#true} call ULTIMATE.init(); {1830#true} is VALID [2022-04-28 02:56:39,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {1830#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(12, 2);call #Ultimate.allocInit(12, 3); {1830#true} is VALID [2022-04-28 02:56:39,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {1830#true} assume true; {1830#true} is VALID [2022-04-28 02:56:39,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1830#true} {1830#true} #34#return; {1830#true} is VALID [2022-04-28 02:56:39,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {1830#true} call #t~ret5 := main(); {1830#true} is VALID [2022-04-28 02:56:39,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {1830#true} ~x~0 := 1;~y~0 := 0; {1835#(= main_~y~0 0)} is VALID [2022-04-28 02:56:39,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {1835#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:39,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {1836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:39,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {1837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:39,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {1838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:39,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {1839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:39,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {1840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:39,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {1841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:39,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {1842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:56:39,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {1887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {1831#false} is VALID [2022-04-28 02:56:39,911 INFO L272 TraceCheckUtils]: 15: Hoare triple {1831#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1831#false} is VALID [2022-04-28 02:56:39,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {1831#false} ~cond := #in~cond; {1831#false} is VALID [2022-04-28 02:56:39,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {1831#false} assume 0 == ~cond; {1831#false} is VALID [2022-04-28 02:56:39,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {1831#false} assume !false; {1831#false} is VALID [2022-04-28 02:56:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:39,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:40,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {1831#false} assume !false; {1831#false} is VALID [2022-04-28 02:56:40,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {1831#false} assume 0 == ~cond; {1831#false} is VALID [2022-04-28 02:56:40,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {1831#false} ~cond := #in~cond; {1831#false} is VALID [2022-04-28 02:56:40,102 INFO L272 TraceCheckUtils]: 15: Hoare triple {1831#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1831#false} is VALID [2022-04-28 02:56:40,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {1915#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {1831#false} is VALID [2022-04-28 02:56:40,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {1919#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1915#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:40,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {1923#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1919#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:40,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {1927#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1923#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:56:40,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {1931#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1927#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:56:40,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {1935#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1931#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:56:40,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {1939#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1935#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:40,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {1943#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1939#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:56:40,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {1947#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1943#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:40,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {1830#true} ~x~0 := 1;~y~0 := 0; {1947#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:56:40,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {1830#true} call #t~ret5 := main(); {1830#true} is VALID [2022-04-28 02:56:40,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1830#true} {1830#true} #34#return; {1830#true} is VALID [2022-04-28 02:56:40,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {1830#true} assume true; {1830#true} is VALID [2022-04-28 02:56:40,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {1830#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(12, 2);call #Ultimate.allocInit(12, 3); {1830#true} is VALID [2022-04-28 02:56:40,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {1830#true} call ULTIMATE.init(); {1830#true} is VALID [2022-04-28 02:56:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:40,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791048040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:40,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:40,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 02:56:40,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:40,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [572345732] [2022-04-28 02:56:40,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [572345732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:40,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:40,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 02:56:40,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897422792] [2022-04-28 02:56:40,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:40,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 19 [2022-04-28 02:56:40,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:40,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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-28 02:56:40,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:40,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 02:56:40,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:40,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 02:56:40,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-04-28 02:56:40,122 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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-28 02:56:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:40,417 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 02:56:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 02:56:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 19 [2022-04-28 02:56:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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-28 02:56:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-28 02:56:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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-28 02:56:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-28 02:56:40,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-28 02:56:40,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:40,446 INFO L225 Difference]: With dead ends: 26 [2022-04-28 02:56:40,446 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 02:56:40,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=657, Unknown=0, NotChecked=0, Total=930 [2022-04-28 02:56:40,447 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:40,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 02:56:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 02:56:40,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:40,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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-28 02:56:40,461 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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-28 02:56:40,463 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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-28 02:56:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:40,464 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 02:56:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 02:56:40,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:40,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:40,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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 21 states. [2022-04-28 02:56:40,465 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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 21 states. [2022-04-28 02:56:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:40,465 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 02:56:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 02:56:40,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:40,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:40,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:40,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 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-28 02:56:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 02:56:40,466 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-28 02:56:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:40,466 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 02:56:40,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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-28 02:56:40,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 02:56:40,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 02:56:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:56:40,486 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:40,486 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:40,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:40,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2022-04-28 02:56:40,687 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:40,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 17 times [2022-04-28 02:56:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:40,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [672358968] [2022-04-28 02:56:41,084 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:41,085 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1394465033, now seen corresponding path program 1 times [2022-04-28 02:56:41,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:41,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876415668] [2022-04-28 02:56:41,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:41,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:41,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:41,099 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 18 times [2022-04-28 02:56:41,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:41,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64285466] [2022-04-28 02:56:41,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:41,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:41,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:41,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {2137#(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(12, 2);call #Ultimate.allocInit(12, 3); {2122#true} is VALID [2022-04-28 02:56:41,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {2122#true} assume true; {2122#true} is VALID [2022-04-28 02:56:41,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2122#true} {2122#true} #34#return; {2122#true} is VALID [2022-04-28 02:56:41,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {2122#true} call ULTIMATE.init(); {2137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:41,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {2137#(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(12, 2);call #Ultimate.allocInit(12, 3); {2122#true} is VALID [2022-04-28 02:56:41,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {2122#true} assume true; {2122#true} is VALID [2022-04-28 02:56:41,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2122#true} {2122#true} #34#return; {2122#true} is VALID [2022-04-28 02:56:41,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {2122#true} call #t~ret5 := main(); {2122#true} is VALID [2022-04-28 02:56:41,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {2122#true} ~x~0 := 1;~y~0 := 0; {2127#(= main_~y~0 0)} is VALID [2022-04-28 02:56:41,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {2127#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:41,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {2128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:41,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {2129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:41,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {2130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:41,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {2131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:41,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {2132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:41,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {2133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:41,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {2134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:56:41,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {2135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2136#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 9))} is VALID [2022-04-28 02:56:41,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {2136#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 9))} assume !(~y~0 % 4294967296 < 1024); {2123#false} is VALID [2022-04-28 02:56:41,277 INFO L272 TraceCheckUtils]: 16: Hoare triple {2123#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2123#false} is VALID [2022-04-28 02:56:41,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {2123#false} ~cond := #in~cond; {2123#false} is VALID [2022-04-28 02:56:41,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {2123#false} assume 0 == ~cond; {2123#false} is VALID [2022-04-28 02:56:41,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {2123#false} assume !false; {2123#false} is VALID [2022-04-28 02:56:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:41,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:41,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64285466] [2022-04-28 02:56:41,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64285466] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:41,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991228155] [2022-04-28 02:56:41,278 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:41,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:41,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:41,279 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:41,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 02:56:41,323 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 02:56:41,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:41,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 02:56:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:41,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:41,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {2122#true} call ULTIMATE.init(); {2122#true} is VALID [2022-04-28 02:56:41,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {2122#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(12, 2);call #Ultimate.allocInit(12, 3); {2122#true} is VALID [2022-04-28 02:56:41,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {2122#true} assume true; {2122#true} is VALID [2022-04-28 02:56:41,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2122#true} {2122#true} #34#return; {2122#true} is VALID [2022-04-28 02:56:41,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {2122#true} call #t~ret5 := main(); {2122#true} is VALID [2022-04-28 02:56:41,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {2122#true} ~x~0 := 1;~y~0 := 0; {2127#(= main_~y~0 0)} is VALID [2022-04-28 02:56:41,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {2127#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:41,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {2128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:41,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {2129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:41,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {2130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:41,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {2131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:41,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {2132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:41,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {2133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:41,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {2134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:56:41,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {2135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2183#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:56:41,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {2183#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~y~0 % 4294967296 < 1024); {2123#false} is VALID [2022-04-28 02:56:41,543 INFO L272 TraceCheckUtils]: 16: Hoare triple {2123#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2123#false} is VALID [2022-04-28 02:56:41,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {2123#false} ~cond := #in~cond; {2123#false} is VALID [2022-04-28 02:56:41,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {2123#false} assume 0 == ~cond; {2123#false} is VALID [2022-04-28 02:56:41,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {2123#false} assume !false; {2123#false} is VALID [2022-04-28 02:56:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:41,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:41,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {2123#false} assume !false; {2123#false} is VALID [2022-04-28 02:56:41,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {2123#false} assume 0 == ~cond; {2123#false} is VALID [2022-04-28 02:56:41,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {2123#false} ~cond := #in~cond; {2123#false} is VALID [2022-04-28 02:56:41,768 INFO L272 TraceCheckUtils]: 16: Hoare triple {2123#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2123#false} is VALID [2022-04-28 02:56:41,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {2211#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {2123#false} is VALID [2022-04-28 02:56:41,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {2215#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2211#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:41,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {2219#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2215#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:41,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {2223#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2219#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:56:41,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {2227#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2223#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:56:41,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {2231#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2227#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:56:41,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {2235#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2231#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:41,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {2239#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2235#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:56:41,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {2243#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2239#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:41,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {2247#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2243#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:56:41,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {2122#true} ~x~0 := 1;~y~0 := 0; {2247#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:56:41,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {2122#true} call #t~ret5 := main(); {2122#true} is VALID [2022-04-28 02:56:41,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2122#true} {2122#true} #34#return; {2122#true} is VALID [2022-04-28 02:56:41,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {2122#true} assume true; {2122#true} is VALID [2022-04-28 02:56:41,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {2122#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(12, 2);call #Ultimate.allocInit(12, 3); {2122#true} is VALID [2022-04-28 02:56:41,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {2122#true} call ULTIMATE.init(); {2122#true} is VALID [2022-04-28 02:56:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:41,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991228155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:41,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:41,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 02:56:41,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:41,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [672358968] [2022-04-28 02:56:41,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [672358968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:41,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:41,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 02:56:41,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651246745] [2022-04-28 02:56:41,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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 20 [2022-04-28 02:56:41,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:41,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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-28 02:56:41,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:41,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 02:56:41,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:41,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 02:56:41,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-28 02:56:41,788 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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-28 02:56:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:42,095 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 02:56:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 02:56:42,095 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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 20 [2022-04-28 02:56:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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-28 02:56:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-28 02:56:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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-28 02:56:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-28 02:56:42,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2022-04-28 02:56:42,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:42,114 INFO L225 Difference]: With dead ends: 27 [2022-04-28 02:56:42,114 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 02:56:42,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=799, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 02:56:42,114 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:42,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 02:56:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 02:56:42,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:42,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-28 02:56:42,127 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-28 02:56:42,127 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-28 02:56:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:42,128 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 02:56:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 02:56:42,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:42,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:42,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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 22 states. [2022-04-28 02:56:42,128 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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 22 states. [2022-04-28 02:56:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:42,129 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 02:56:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 02:56:42,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:42,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:42,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:42,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-28 02:56:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-28 02:56:42,129 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-28 02:56:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:42,130 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-28 02:56:42,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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-28 02:56:42,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-28 02:56:42,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 02:56:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:56:42,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:42,148 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:42,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:42,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:42,349 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 19 times [2022-04-28 02:56:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:42,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1415848193] [2022-04-28 02:56:45,199 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:56:45,328 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:45,330 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:45,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1335359689, now seen corresponding path program 1 times [2022-04-28 02:56:45,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:45,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658976202] [2022-04-28 02:56:45,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:45,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:45,340 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:45,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:45,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 20 times [2022-04-28 02:56:45,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:45,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490592616] [2022-04-28 02:56:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:45,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:45,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {2446#(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(12, 2);call #Ultimate.allocInit(12, 3); {2430#true} is VALID [2022-04-28 02:56:45,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-28 02:56:45,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2430#true} {2430#true} #34#return; {2430#true} is VALID [2022-04-28 02:56:45,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {2430#true} call ULTIMATE.init(); {2446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:45,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {2446#(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(12, 2);call #Ultimate.allocInit(12, 3); {2430#true} is VALID [2022-04-28 02:56:45,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-28 02:56:45,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2430#true} {2430#true} #34#return; {2430#true} is VALID [2022-04-28 02:56:45,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {2430#true} call #t~ret5 := main(); {2430#true} is VALID [2022-04-28 02:56:45,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {2430#true} ~x~0 := 1;~y~0 := 0; {2435#(= main_~y~0 0)} is VALID [2022-04-28 02:56:45,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {2435#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2436#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:45,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {2436#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2437#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:45,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {2437#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2438#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:45,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {2438#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2439#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:45,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {2439#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2440#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:45,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {2440#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2441#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:45,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {2441#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2442#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:45,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {2442#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2443#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:56:45,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {2443#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2444#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:56:45,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {2444#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2445#(and (<= main_~y~0 10) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:56:45,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {2445#(and (<= main_~y~0 10) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {2431#false} is VALID [2022-04-28 02:56:45,502 INFO L272 TraceCheckUtils]: 17: Hoare triple {2431#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2431#false} is VALID [2022-04-28 02:56:45,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {2431#false} ~cond := #in~cond; {2431#false} is VALID [2022-04-28 02:56:45,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {2431#false} assume 0 == ~cond; {2431#false} is VALID [2022-04-28 02:56:45,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {2431#false} assume !false; {2431#false} is VALID [2022-04-28 02:56:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:45,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:45,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490592616] [2022-04-28 02:56:45,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490592616] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:45,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471133138] [2022-04-28 02:56:45,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:45,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:45,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:45,504 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:45,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 02:56:45,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:45,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:45,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 02:56:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:45,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:45,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {2430#true} call ULTIMATE.init(); {2430#true} is VALID [2022-04-28 02:56:45,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {2430#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(12, 2);call #Ultimate.allocInit(12, 3); {2430#true} is VALID [2022-04-28 02:56:45,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-28 02:56:45,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2430#true} {2430#true} #34#return; {2430#true} is VALID [2022-04-28 02:56:45,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {2430#true} call #t~ret5 := main(); {2430#true} is VALID [2022-04-28 02:56:45,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {2430#true} ~x~0 := 1;~y~0 := 0; {2435#(= main_~y~0 0)} is VALID [2022-04-28 02:56:45,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {2435#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2436#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:45,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {2436#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2437#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:45,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {2437#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2438#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:45,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {2438#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2439#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:45,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {2439#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2440#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:45,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {2440#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2441#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:45,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {2441#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2442#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:45,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {2442#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2443#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:56:45,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {2443#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2444#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:56:45,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {2444#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2495#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:56:45,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {2495#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {2431#false} is VALID [2022-04-28 02:56:45,730 INFO L272 TraceCheckUtils]: 17: Hoare triple {2431#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2431#false} is VALID [2022-04-28 02:56:45,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {2431#false} ~cond := #in~cond; {2431#false} is VALID [2022-04-28 02:56:45,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {2431#false} assume 0 == ~cond; {2431#false} is VALID [2022-04-28 02:56:45,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {2431#false} assume !false; {2431#false} is VALID [2022-04-28 02:56:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:45,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:46,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {2431#false} assume !false; {2431#false} is VALID [2022-04-28 02:56:46,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {2431#false} assume 0 == ~cond; {2431#false} is VALID [2022-04-28 02:56:46,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {2431#false} ~cond := #in~cond; {2431#false} is VALID [2022-04-28 02:56:46,027 INFO L272 TraceCheckUtils]: 17: Hoare triple {2431#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2431#false} is VALID [2022-04-28 02:56:46,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {2523#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {2431#false} is VALID [2022-04-28 02:56:46,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {2527#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2523#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:46,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {2531#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2527#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:46,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {2535#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2531#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:56:46,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {2539#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2535#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:56:46,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {2543#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2539#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:56:46,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {2547#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2543#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:46,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {2551#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2547#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:56:46,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {2555#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2551#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:46,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {2559#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2555#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:56:46,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {2563#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2559#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:56:46,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {2430#true} ~x~0 := 1;~y~0 := 0; {2563#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:56:46,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {2430#true} call #t~ret5 := main(); {2430#true} is VALID [2022-04-28 02:56:46,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2430#true} {2430#true} #34#return; {2430#true} is VALID [2022-04-28 02:56:46,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-28 02:56:46,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {2430#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(12, 2);call #Ultimate.allocInit(12, 3); {2430#true} is VALID [2022-04-28 02:56:46,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {2430#true} call ULTIMATE.init(); {2430#true} is VALID [2022-04-28 02:56:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:46,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471133138] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:46,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:46,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 02:56:46,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:46,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1415848193] [2022-04-28 02:56:46,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1415848193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:46,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:46,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 02:56:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992744017] [2022-04-28 02:56:46,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:46,037 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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 21 [2022-04-28 02:56:46,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:46,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-28 02:56:46,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:46,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 02:56:46,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:46,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 02:56:46,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-28 02:56:46,053 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-28 02:56:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:46,426 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 02:56:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 02:56:46,426 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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 21 [2022-04-28 02:56:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-28 02:56:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-28 02:56:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-28 02:56:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-28 02:56:46,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-28 02:56:46,467 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-28 02:56:46,468 INFO L225 Difference]: With dead ends: 28 [2022-04-28 02:56:46,468 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 02:56:46,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 02:56:46,469 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:46,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:46,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 02:56:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 02:56:46,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:46,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-28 02:56:46,482 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-28 02:56:46,482 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-28 02:56:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:46,483 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 02:56:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 02:56:46,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:46,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:46,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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 23 states. [2022-04-28 02:56:46,483 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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 23 states. [2022-04-28 02:56:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:46,484 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 02:56:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 02:56:46,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:46,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:46,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:46,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-28 02:56:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 02:56:46,485 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-28 02:56:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:46,485 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 02:56:46,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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-28 02:56:46,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 02:56:46,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 02:56:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:56:46,502 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:46,502 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:46,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:46,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21 [2022-04-28 02:56:46,703 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:46,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 21 times [2022-04-28 02:56:46,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:46,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [219282194] [2022-04-28 02:56:47,777 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:47,778 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1276254345, now seen corresponding path program 1 times [2022-04-28 02:56:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:47,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032893486] [2022-04-28 02:56:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:47,785 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:47,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:47,789 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 22 times [2022-04-28 02:56:47,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:47,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615812461] [2022-04-28 02:56:47,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:47,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:47,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:47,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {2771#(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(12, 2);call #Ultimate.allocInit(12, 3); {2754#true} is VALID [2022-04-28 02:56:47,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {2754#true} assume true; {2754#true} is VALID [2022-04-28 02:56:47,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2754#true} {2754#true} #34#return; {2754#true} is VALID [2022-04-28 02:56:47,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {2754#true} call ULTIMATE.init(); {2771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:47,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {2771#(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(12, 2);call #Ultimate.allocInit(12, 3); {2754#true} is VALID [2022-04-28 02:56:47,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {2754#true} assume true; {2754#true} is VALID [2022-04-28 02:56:47,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2754#true} {2754#true} #34#return; {2754#true} is VALID [2022-04-28 02:56:47,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {2754#true} call #t~ret5 := main(); {2754#true} is VALID [2022-04-28 02:56:47,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {2754#true} ~x~0 := 1;~y~0 := 0; {2759#(= main_~y~0 0)} is VALID [2022-04-28 02:56:47,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {2759#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2760#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:47,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {2760#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2761#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:47,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {2761#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2762#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:47,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {2762#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2763#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:47,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {2763#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2764#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:47,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {2764#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2765#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:47,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {2765#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2766#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:47,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {2766#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2767#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:56:47,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {2767#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2768#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:56:47,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {2768#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2769#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:56:47,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {2769#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2770#(and (<= main_~y~0 11) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:56:47,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {2770#(and (<= main_~y~0 11) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {2755#false} is VALID [2022-04-28 02:56:47,966 INFO L272 TraceCheckUtils]: 18: Hoare triple {2755#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2755#false} is VALID [2022-04-28 02:56:47,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {2755#false} ~cond := #in~cond; {2755#false} is VALID [2022-04-28 02:56:47,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {2755#false} assume 0 == ~cond; {2755#false} is VALID [2022-04-28 02:56:47,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {2755#false} assume !false; {2755#false} is VALID [2022-04-28 02:56:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:47,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:47,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615812461] [2022-04-28 02:56:47,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615812461] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:47,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889936648] [2022-04-28 02:56:47,966 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:47,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:47,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:47,967 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:47,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 02:56:47,999 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:47,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:48,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 02:56:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:48,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:48,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {2754#true} call ULTIMATE.init(); {2754#true} is VALID [2022-04-28 02:56:48,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {2754#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(12, 2);call #Ultimate.allocInit(12, 3); {2754#true} is VALID [2022-04-28 02:56:48,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {2754#true} assume true; {2754#true} is VALID [2022-04-28 02:56:48,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2754#true} {2754#true} #34#return; {2754#true} is VALID [2022-04-28 02:56:48,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {2754#true} call #t~ret5 := main(); {2754#true} is VALID [2022-04-28 02:56:48,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {2754#true} ~x~0 := 1;~y~0 := 0; {2759#(= main_~y~0 0)} is VALID [2022-04-28 02:56:48,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {2759#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2760#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:48,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {2760#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2761#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:48,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {2761#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2762#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:48,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {2762#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2763#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:48,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {2763#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2764#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:48,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {2764#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2765#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:48,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {2765#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2766#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:48,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {2766#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2767#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:56:48,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {2767#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2768#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:56:48,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {2768#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2769#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:56:48,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {2769#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2823#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:56:48,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {2823#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {2755#false} is VALID [2022-04-28 02:56:48,230 INFO L272 TraceCheckUtils]: 18: Hoare triple {2755#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2755#false} is VALID [2022-04-28 02:56:48,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {2755#false} ~cond := #in~cond; {2755#false} is VALID [2022-04-28 02:56:48,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {2755#false} assume 0 == ~cond; {2755#false} is VALID [2022-04-28 02:56:48,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {2755#false} assume !false; {2755#false} is VALID [2022-04-28 02:56:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:48,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:48,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {2755#false} assume !false; {2755#false} is VALID [2022-04-28 02:56:48,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {2755#false} assume 0 == ~cond; {2755#false} is VALID [2022-04-28 02:56:48,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {2755#false} ~cond := #in~cond; {2755#false} is VALID [2022-04-28 02:56:48,574 INFO L272 TraceCheckUtils]: 18: Hoare triple {2755#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2755#false} is VALID [2022-04-28 02:56:48,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {2851#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {2755#false} is VALID [2022-04-28 02:56:48,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {2855#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2851#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:48,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {2859#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2855#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:48,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {2863#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2859#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:56:48,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {2867#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2863#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:56:48,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {2871#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2867#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:56:48,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {2875#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2871#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:48,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {2879#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2875#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:56:48,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {2883#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2879#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:48,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {2887#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2883#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:56:48,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {2891#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2887#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:56:48,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {2895#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2891#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:56:48,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {2754#true} ~x~0 := 1;~y~0 := 0; {2895#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:56:48,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {2754#true} call #t~ret5 := main(); {2754#true} is VALID [2022-04-28 02:56:48,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2754#true} {2754#true} #34#return; {2754#true} is VALID [2022-04-28 02:56:48,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {2754#true} assume true; {2754#true} is VALID [2022-04-28 02:56:48,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {2754#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(12, 2);call #Ultimate.allocInit(12, 3); {2754#true} is VALID [2022-04-28 02:56:48,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {2754#true} call ULTIMATE.init(); {2754#true} is VALID [2022-04-28 02:56:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:48,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889936648] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:48,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:48,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 02:56:48,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:48,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [219282194] [2022-04-28 02:56:48,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [219282194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:48,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:48,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 02:56:48,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425852703] [2022-04-28 02:56:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:48,585 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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 22 [2022-04-28 02:56:48,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:48,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-28 02:56:48,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:48,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 02:56:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:48,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 02:56:48,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-04-28 02:56:48,599 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-28 02:56:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:49,025 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 02:56:49,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 02:56:49,026 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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 22 [2022-04-28 02:56:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-28 02:56:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-28 02:56:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-28 02:56:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-28 02:56:49,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2022-04-28 02:56:49,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:49,046 INFO L225 Difference]: With dead ends: 29 [2022-04-28 02:56:49,046 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 02:56:49,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 02:56:49,047 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:49,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 02:56:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 02:56:49,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:49,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-28 02:56:49,065 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-28 02:56:49,065 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-28 02:56:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:49,066 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 02:56:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 02:56:49,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:49,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:49,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 24 states. [2022-04-28 02:56:49,066 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 24 states. [2022-04-28 02:56:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:49,066 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 02:56:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 02:56:49,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:49,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:49,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:49,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-28 02:56:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-28 02:56:49,068 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-28 02:56:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:49,068 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-28 02:56:49,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-28 02:56:49,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-28 02:56:49,087 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-28 02:56:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 02:56:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:56:49,087 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:49,087 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:49,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:49,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23 [2022-04-28 02:56:49,288 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:49,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:49,288 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 23 times [2022-04-28 02:56:49,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:49,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [838062207] [2022-04-28 02:56:51,937 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:51,938 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:51,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1217149001, now seen corresponding path program 1 times [2022-04-28 02:56:51,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:51,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568102984] [2022-04-28 02:56:51,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:51,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:51,946 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:51,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:51,950 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 24 times [2022-04-28 02:56:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:51,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550708885] [2022-04-28 02:56:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:52,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:52,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {3112#(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(12, 2);call #Ultimate.allocInit(12, 3); {3094#true} is VALID [2022-04-28 02:56:52,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {3094#true} assume true; {3094#true} is VALID [2022-04-28 02:56:52,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3094#true} {3094#true} #34#return; {3094#true} is VALID [2022-04-28 02:56:52,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {3094#true} call ULTIMATE.init(); {3112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:52,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {3112#(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(12, 2);call #Ultimate.allocInit(12, 3); {3094#true} is VALID [2022-04-28 02:56:52,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {3094#true} assume true; {3094#true} is VALID [2022-04-28 02:56:52,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3094#true} {3094#true} #34#return; {3094#true} is VALID [2022-04-28 02:56:52,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {3094#true} call #t~ret5 := main(); {3094#true} is VALID [2022-04-28 02:56:52,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {3094#true} ~x~0 := 1;~y~0 := 0; {3099#(= main_~y~0 0)} is VALID [2022-04-28 02:56:52,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {3099#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3100#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:52,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {3100#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3101#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:52,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {3101#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3102#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:52,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {3102#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3103#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:52,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {3103#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3104#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:52,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {3104#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3105#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:52,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {3105#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3106#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:52,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {3106#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3107#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:56:52,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {3107#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3108#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:56:52,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {3108#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3109#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:56:52,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {3109#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3110#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:56:52,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {3110#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3111#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 12))} is VALID [2022-04-28 02:56:52,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {3111#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 12))} assume !(~y~0 % 4294967296 < 1024); {3095#false} is VALID [2022-04-28 02:56:52,123 INFO L272 TraceCheckUtils]: 19: Hoare triple {3095#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3095#false} is VALID [2022-04-28 02:56:52,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {3095#false} ~cond := #in~cond; {3095#false} is VALID [2022-04-28 02:56:52,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {3095#false} assume 0 == ~cond; {3095#false} is VALID [2022-04-28 02:56:52,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {3095#false} assume !false; {3095#false} is VALID [2022-04-28 02:56:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:52,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550708885] [2022-04-28 02:56:52,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550708885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:52,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066045710] [2022-04-28 02:56:52,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:52,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:52,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:52,125 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:52,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 02:56:52,174 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 02:56:52,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:52,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 02:56:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:52,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:52,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {3094#true} call ULTIMATE.init(); {3094#true} is VALID [2022-04-28 02:56:52,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {3094#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(12, 2);call #Ultimate.allocInit(12, 3); {3094#true} is VALID [2022-04-28 02:56:52,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {3094#true} assume true; {3094#true} is VALID [2022-04-28 02:56:52,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3094#true} {3094#true} #34#return; {3094#true} is VALID [2022-04-28 02:56:52,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {3094#true} call #t~ret5 := main(); {3094#true} is VALID [2022-04-28 02:56:52,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {3094#true} ~x~0 := 1;~y~0 := 0; {3099#(= main_~y~0 0)} is VALID [2022-04-28 02:56:52,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {3099#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3100#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:52,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {3100#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3101#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:52,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {3101#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3102#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:52,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {3102#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3103#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:52,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {3103#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3104#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:52,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {3104#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3105#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:52,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {3105#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3106#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:52,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {3106#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3107#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:56:52,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {3107#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3108#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:56:52,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {3108#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3109#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:56:52,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {3109#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3110#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:56:52,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {3110#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3167#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:56:52,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {3167#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~y~0 % 4294967296 < 1024); {3095#false} is VALID [2022-04-28 02:56:52,401 INFO L272 TraceCheckUtils]: 19: Hoare triple {3095#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3095#false} is VALID [2022-04-28 02:56:52,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {3095#false} ~cond := #in~cond; {3095#false} is VALID [2022-04-28 02:56:52,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {3095#false} assume 0 == ~cond; {3095#false} is VALID [2022-04-28 02:56:52,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {3095#false} assume !false; {3095#false} is VALID [2022-04-28 02:56:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:52,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:52,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {3095#false} assume !false; {3095#false} is VALID [2022-04-28 02:56:52,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {3095#false} assume 0 == ~cond; {3095#false} is VALID [2022-04-28 02:56:52,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {3095#false} ~cond := #in~cond; {3095#false} is VALID [2022-04-28 02:56:52,720 INFO L272 TraceCheckUtils]: 19: Hoare triple {3095#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3095#false} is VALID [2022-04-28 02:56:52,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {3195#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {3095#false} is VALID [2022-04-28 02:56:52,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {3199#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3195#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:52,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {3203#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3199#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:52,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {3207#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3203#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:56:52,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {3211#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3207#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:56:52,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {3215#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3211#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:56:52,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {3219#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3215#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:52,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {3223#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3219#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:56:52,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {3227#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3223#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:52,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {3231#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3227#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:56:52,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {3235#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3231#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:56:52,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {3239#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3235#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:56:52,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {3243#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3239#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:56:52,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {3094#true} ~x~0 := 1;~y~0 := 0; {3243#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:56:52,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {3094#true} call #t~ret5 := main(); {3094#true} is VALID [2022-04-28 02:56:52,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3094#true} {3094#true} #34#return; {3094#true} is VALID [2022-04-28 02:56:52,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {3094#true} assume true; {3094#true} is VALID [2022-04-28 02:56:52,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {3094#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(12, 2);call #Ultimate.allocInit(12, 3); {3094#true} is VALID [2022-04-28 02:56:52,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {3094#true} call ULTIMATE.init(); {3094#true} is VALID [2022-04-28 02:56:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:52,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066045710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:52,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:52,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 02:56:52,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:52,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [838062207] [2022-04-28 02:56:52,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [838062207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:52,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:52,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 02:56:52,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424194194] [2022-04-28 02:56:52,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:52,742 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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 23 [2022-04-28 02:56:52,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:52,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-28 02:56:52,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:52,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 02:56:52,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:52,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 02:56:52,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2022-04-28 02:56:52,756 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-28 02:56:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:53,178 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 02:56:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 02:56:53,178 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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 23 [2022-04-28 02:56:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-28 02:56:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-28 02:56:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-28 02:56:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-28 02:56:53,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-28 02:56:53,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:53,201 INFO L225 Difference]: With dead ends: 30 [2022-04-28 02:56:53,201 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 02:56:53,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=497, Invalid=1309, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 02:56:53,203 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:53,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 02:56:53,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 02:56:53,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:53,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-28 02:56:53,227 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-28 02:56:53,227 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-28 02:56:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:53,228 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 02:56:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 02:56:53,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:53,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:53,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 25 states. [2022-04-28 02:56:53,228 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 25 states. [2022-04-28 02:56:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:53,229 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 02:56:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 02:56:53,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:53,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:53,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:53,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-28 02:56:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 02:56:53,229 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-28 02:56:53,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:53,230 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 02:56:53,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-28 02:56:53,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 02:56:53,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 02:56:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:56:53,252 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:53,252 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:53,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:53,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25 [2022-04-28 02:56:53,466 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:53,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:53,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 25 times [2022-04-28 02:56:53,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:53,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [555772991] [2022-04-28 02:56:55,804 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:55,806 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:55,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1158043657, now seen corresponding path program 1 times [2022-04-28 02:56:55,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:55,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694883765] [2022-04-28 02:56:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:55,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:55,821 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:55,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 26 times [2022-04-28 02:56:55,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:55,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705336846] [2022-04-28 02:56:55,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:56,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {3469#(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(12, 2);call #Ultimate.allocInit(12, 3); {3450#true} is VALID [2022-04-28 02:56:56,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {3450#true} assume true; {3450#true} is VALID [2022-04-28 02:56:56,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3450#true} {3450#true} #34#return; {3450#true} is VALID [2022-04-28 02:56:56,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {3450#true} call ULTIMATE.init(); {3469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:56,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {3469#(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(12, 2);call #Ultimate.allocInit(12, 3); {3450#true} is VALID [2022-04-28 02:56:56,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {3450#true} assume true; {3450#true} is VALID [2022-04-28 02:56:56,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3450#true} {3450#true} #34#return; {3450#true} is VALID [2022-04-28 02:56:56,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {3450#true} call #t~ret5 := main(); {3450#true} is VALID [2022-04-28 02:56:56,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {3450#true} ~x~0 := 1;~y~0 := 0; {3455#(= main_~y~0 0)} is VALID [2022-04-28 02:56:56,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {3455#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3456#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:56,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {3456#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3457#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:56,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {3457#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3458#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:56,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {3458#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3459#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:56,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {3459#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3460#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:56,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {3460#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3461#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:56,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {3461#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3462#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:56,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {3462#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3463#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:56:56,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {3463#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3464#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:56:56,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {3464#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3465#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:56:56,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {3465#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3466#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:56:56,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {3466#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3467#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:56:56,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {3467#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3468#(and (<= main_~y~0 13) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:56:56,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {3468#(and (<= main_~y~0 13) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {3451#false} is VALID [2022-04-28 02:56:56,045 INFO L272 TraceCheckUtils]: 20: Hoare triple {3451#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3451#false} is VALID [2022-04-28 02:56:56,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {3451#false} ~cond := #in~cond; {3451#false} is VALID [2022-04-28 02:56:56,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {3451#false} assume 0 == ~cond; {3451#false} is VALID [2022-04-28 02:56:56,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {3451#false} assume !false; {3451#false} is VALID [2022-04-28 02:56:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:56,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:56,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705336846] [2022-04-28 02:56:56,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705336846] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:56,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541718986] [2022-04-28 02:56:56,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:56,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:56,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:56,047 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:56,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 02:56:56,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:56,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:56,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 02:56:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:56,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:56,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {3450#true} call ULTIMATE.init(); {3450#true} is VALID [2022-04-28 02:56:56,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {3450#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(12, 2);call #Ultimate.allocInit(12, 3); {3450#true} is VALID [2022-04-28 02:56:56,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {3450#true} assume true; {3450#true} is VALID [2022-04-28 02:56:56,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3450#true} {3450#true} #34#return; {3450#true} is VALID [2022-04-28 02:56:56,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {3450#true} call #t~ret5 := main(); {3450#true} is VALID [2022-04-28 02:56:56,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {3450#true} ~x~0 := 1;~y~0 := 0; {3455#(= main_~y~0 0)} is VALID [2022-04-28 02:56:56,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {3455#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3456#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:56:56,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {3456#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3457#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:56:56,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {3457#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3458#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:56:56,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {3458#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3459#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:56:56,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {3459#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3460#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:56:56,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {3460#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3461#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:56:56,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {3461#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3462#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:56:56,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {3462#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3463#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:56:56,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {3463#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3464#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:56:56,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {3464#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3465#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:56:56,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {3465#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3466#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:56:56,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {3466#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3467#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:56:56,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {3467#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3527#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:56:56,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {3527#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {3451#false} is VALID [2022-04-28 02:56:56,331 INFO L272 TraceCheckUtils]: 20: Hoare triple {3451#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3451#false} is VALID [2022-04-28 02:56:56,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {3451#false} ~cond := #in~cond; {3451#false} is VALID [2022-04-28 02:56:56,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {3451#false} assume 0 == ~cond; {3451#false} is VALID [2022-04-28 02:56:56,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {3451#false} assume !false; {3451#false} is VALID [2022-04-28 02:56:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:56,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:56,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {3451#false} assume !false; {3451#false} is VALID [2022-04-28 02:56:56,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {3451#false} assume 0 == ~cond; {3451#false} is VALID [2022-04-28 02:56:56,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {3451#false} ~cond := #in~cond; {3451#false} is VALID [2022-04-28 02:56:56,703 INFO L272 TraceCheckUtils]: 20: Hoare triple {3451#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3451#false} is VALID [2022-04-28 02:56:56,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {3555#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {3451#false} is VALID [2022-04-28 02:56:56,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {3559#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3555#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:56:56,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {3563#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3559#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {3567#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3563#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {3571#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3567#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {3575#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3571#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {3579#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3575#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {3583#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3579#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {3587#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3583#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {3591#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3587#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {3595#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3591#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {3599#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3595#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {3603#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3599#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {3607#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3603#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {3450#true} ~x~0 := 1;~y~0 := 0; {3607#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:56:56,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {3450#true} call #t~ret5 := main(); {3450#true} is VALID [2022-04-28 02:56:56,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3450#true} {3450#true} #34#return; {3450#true} is VALID [2022-04-28 02:56:56,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {3450#true} assume true; {3450#true} is VALID [2022-04-28 02:56:56,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {3450#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(12, 2);call #Ultimate.allocInit(12, 3); {3450#true} is VALID [2022-04-28 02:56:56,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {3450#true} call ULTIMATE.init(); {3450#true} is VALID [2022-04-28 02:56:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:56,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541718986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:56,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:56,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 02:56:56,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:56,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [555772991] [2022-04-28 02:56:56,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [555772991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:56,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:56,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 02:56:56,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620918841] [2022-04-28 02:56:56,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:56,714 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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 24 [2022-04-28 02:56:56,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:56,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-28 02:56:56,728 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-28 02:56:56,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 02:56:56,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:56,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 02:56:56,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-28 02:56:56,729 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-28 02:56:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:57,254 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 02:56:57,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 02:56:57,254 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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 24 [2022-04-28 02:56:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-28 02:56:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-28 02:56:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-28 02:56:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-28 02:56:57,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-04-28 02:56:57,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:57,280 INFO L225 Difference]: With dead ends: 31 [2022-04-28 02:56:57,280 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 02:56:57,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=563, Invalid=1507, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 02:56:57,281 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:57,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 58 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:56:57,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 02:56:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 02:56:57,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:57,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-28 02:56:57,300 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-28 02:56:57,300 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-28 02:56:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:57,301 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 02:56:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 02:56:57,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:57,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:57,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 26 states. [2022-04-28 02:56:57,301 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 26 states. [2022-04-28 02:56:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:57,301 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 02:56:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 02:56:57,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:57,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:57,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:57,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-28 02:56:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-28 02:56:57,302 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-28 02:56:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:57,302 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-28 02:56:57,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-28 02:56:57,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-28 02:56:57,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 02:56:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:56:57,325 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:57,325 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:57,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 02:56:57,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27 [2022-04-28 02:56:57,526 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 27 times [2022-04-28 02:56:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:57,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1404303380] [2022-04-28 02:56:59,835 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:56:59,836 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1098938313, now seen corresponding path program 1 times [2022-04-28 02:56:59,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:59,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708714461] [2022-04-28 02:56:59,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:59,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:59,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 28 times [2022-04-28 02:56:59,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:59,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311126963] [2022-04-28 02:56:59,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:59,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:00,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:00,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {3842#(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(12, 2);call #Ultimate.allocInit(12, 3); {3822#true} is VALID [2022-04-28 02:57:00,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {3822#true} assume true; {3822#true} is VALID [2022-04-28 02:57:00,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3822#true} {3822#true} #34#return; {3822#true} is VALID [2022-04-28 02:57:00,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {3822#true} call ULTIMATE.init(); {3842#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:00,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {3842#(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(12, 2);call #Ultimate.allocInit(12, 3); {3822#true} is VALID [2022-04-28 02:57:00,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {3822#true} assume true; {3822#true} is VALID [2022-04-28 02:57:00,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3822#true} {3822#true} #34#return; {3822#true} is VALID [2022-04-28 02:57:00,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {3822#true} call #t~ret5 := main(); {3822#true} is VALID [2022-04-28 02:57:00,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {3822#true} ~x~0 := 1;~y~0 := 0; {3827#(= main_~y~0 0)} is VALID [2022-04-28 02:57:00,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {3827#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:00,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {3828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:00,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {3829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:00,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3831#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:00,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {3831#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3832#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:00,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {3832#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3833#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:00,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {3833#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3834#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:00,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {3834#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3835#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:00,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {3835#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3836#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:00,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {3836#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3837#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:00,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {3837#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3838#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:00,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {3838#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3839#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:00,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {3839#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3840#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:00,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {3840#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3841#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:00,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {3841#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 14))} assume !(~y~0 % 4294967296 < 1024); {3823#false} is VALID [2022-04-28 02:57:00,070 INFO L272 TraceCheckUtils]: 21: Hoare triple {3823#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3823#false} is VALID [2022-04-28 02:57:00,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {3823#false} ~cond := #in~cond; {3823#false} is VALID [2022-04-28 02:57:00,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {3823#false} assume 0 == ~cond; {3823#false} is VALID [2022-04-28 02:57:00,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {3823#false} assume !false; {3823#false} is VALID [2022-04-28 02:57:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:00,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:00,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311126963] [2022-04-28 02:57:00,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311126963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:00,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291486987] [2022-04-28 02:57:00,071 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:57:00,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:00,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:00,072 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:00,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 02:57:00,102 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:57:00,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:00,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 02:57:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:00,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:00,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {3822#true} call ULTIMATE.init(); {3822#true} is VALID [2022-04-28 02:57:00,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {3822#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(12, 2);call #Ultimate.allocInit(12, 3); {3822#true} is VALID [2022-04-28 02:57:00,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {3822#true} assume true; {3822#true} is VALID [2022-04-28 02:57:00,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3822#true} {3822#true} #34#return; {3822#true} is VALID [2022-04-28 02:57:00,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {3822#true} call #t~ret5 := main(); {3822#true} is VALID [2022-04-28 02:57:00,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {3822#true} ~x~0 := 1;~y~0 := 0; {3827#(= main_~y~0 0)} is VALID [2022-04-28 02:57:00,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {3827#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:00,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {3828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:00,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {3829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:00,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3831#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:00,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {3831#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3832#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:00,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {3832#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3833#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:00,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {3833#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3834#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:00,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {3834#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3835#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:00,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {3835#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3836#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:00,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {3836#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3837#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:00,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {3837#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3838#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:00,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {3838#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3839#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:00,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {3839#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3840#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:00,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {3840#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3903#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:00,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {3903#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~y~0 % 4294967296 < 1024); {3823#false} is VALID [2022-04-28 02:57:00,346 INFO L272 TraceCheckUtils]: 21: Hoare triple {3823#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3823#false} is VALID [2022-04-28 02:57:00,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {3823#false} ~cond := #in~cond; {3823#false} is VALID [2022-04-28 02:57:00,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {3823#false} assume 0 == ~cond; {3823#false} is VALID [2022-04-28 02:57:00,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {3823#false} assume !false; {3823#false} is VALID [2022-04-28 02:57:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:00,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:00,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {3823#false} assume !false; {3823#false} is VALID [2022-04-28 02:57:00,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {3823#false} assume 0 == ~cond; {3823#false} is VALID [2022-04-28 02:57:00,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {3823#false} ~cond := #in~cond; {3823#false} is VALID [2022-04-28 02:57:00,799 INFO L272 TraceCheckUtils]: 21: Hoare triple {3823#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3823#false} is VALID [2022-04-28 02:57:00,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {3931#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {3823#false} is VALID [2022-04-28 02:57:00,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {3935#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3931#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:00,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {3939#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3935#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {3943#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3939#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {3947#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3943#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {3951#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3947#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {3955#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3951#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {3959#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3955#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {3963#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3959#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {3967#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3963#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {3971#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3967#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {3975#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3971#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {3979#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3975#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {3983#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3979#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {3987#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3983#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {3822#true} ~x~0 := 1;~y~0 := 0; {3987#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:00,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {3822#true} call #t~ret5 := main(); {3822#true} is VALID [2022-04-28 02:57:00,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3822#true} {3822#true} #34#return; {3822#true} is VALID [2022-04-28 02:57:00,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {3822#true} assume true; {3822#true} is VALID [2022-04-28 02:57:00,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {3822#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(12, 2);call #Ultimate.allocInit(12, 3); {3822#true} is VALID [2022-04-28 02:57:00,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {3822#true} call ULTIMATE.init(); {3822#true} is VALID [2022-04-28 02:57:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:00,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291486987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:00,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:00,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 02:57:00,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:00,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1404303380] [2022-04-28 02:57:00,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1404303380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:00,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:00,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 02:57:00,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285684118] [2022-04-28 02:57:00,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:00,815 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 25 [2022-04-28 02:57:00,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:00,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-28 02:57:00,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:00,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 02:57:00,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:00,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 02:57:00,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 02:57:00,833 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-28 02:57:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:01,474 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 02:57:01,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 02:57:01,475 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 25 [2022-04-28 02:57:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-28 02:57:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-28 02:57:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-28 02:57:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-28 02:57:01,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-28 02:57:01,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:01,496 INFO L225 Difference]: With dead ends: 32 [2022-04-28 02:57:01,496 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 02:57:01,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=633, Invalid=1719, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 02:57:01,497 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:01,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:57:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 02:57:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 02:57:01,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:01,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-28 02:57:01,524 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-28 02:57:01,524 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-28 02:57:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:01,524 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 02:57:01,524 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 02:57:01,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:01,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:01,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 02:57:01,525 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 02:57:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:01,525 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 02:57:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 02:57:01,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:01,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:01,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:01,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:01,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-28 02:57:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 02:57:01,526 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-28 02:57:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:01,526 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 02:57:01,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-28 02:57:01,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 02:57:01,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 02:57:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:57:01,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:01,548 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:01,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 02:57:01,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:01,749 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 29 times [2022-04-28 02:57:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:01,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1278521209] [2022-04-28 02:57:03,233 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:03,235 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1039832969, now seen corresponding path program 1 times [2022-04-28 02:57:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:03,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175343860] [2022-04-28 02:57:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:03,242 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:57:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:03,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:57:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 30 times [2022-04-28 02:57:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:03,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587536995] [2022-04-28 02:57:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:03,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:03,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {4231#(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(12, 2);call #Ultimate.allocInit(12, 3); {4210#true} is VALID [2022-04-28 02:57:03,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {4210#true} assume true; {4210#true} is VALID [2022-04-28 02:57:03,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4210#true} {4210#true} #34#return; {4210#true} is VALID [2022-04-28 02:57:03,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {4210#true} call ULTIMATE.init(); {4231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:03,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {4231#(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(12, 2);call #Ultimate.allocInit(12, 3); {4210#true} is VALID [2022-04-28 02:57:03,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {4210#true} assume true; {4210#true} is VALID [2022-04-28 02:57:03,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4210#true} {4210#true} #34#return; {4210#true} is VALID [2022-04-28 02:57:03,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {4210#true} call #t~ret5 := main(); {4210#true} is VALID [2022-04-28 02:57:03,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {4210#true} ~x~0 := 1;~y~0 := 0; {4215#(= main_~y~0 0)} is VALID [2022-04-28 02:57:03,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {4215#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:03,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {4216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4217#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:03,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {4217#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4218#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:03,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {4218#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4219#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:03,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {4219#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4220#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:03,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {4220#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4221#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:03,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {4221#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4222#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:03,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {4222#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4223#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:03,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {4223#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4224#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:03,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {4224#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4225#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:03,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {4225#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4226#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:03,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {4226#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4227#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:03,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {4227#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4228#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:03,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {4228#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4229#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:03,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {4229#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4230#(and (<= main_~y~0 15) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:57:03,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {4230#(and (<= main_~y~0 15) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {4211#false} is VALID [2022-04-28 02:57:03,529 INFO L272 TraceCheckUtils]: 22: Hoare triple {4211#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {4211#false} is VALID [2022-04-28 02:57:03,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {4211#false} ~cond := #in~cond; {4211#false} is VALID [2022-04-28 02:57:03,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {4211#false} assume 0 == ~cond; {4211#false} is VALID [2022-04-28 02:57:03,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {4211#false} assume !false; {4211#false} is VALID [2022-04-28 02:57:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:03,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587536995] [2022-04-28 02:57:03,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587536995] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:03,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848813825] [2022-04-28 02:57:03,530 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:57:03,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:03,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:03,546 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:03,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 02:57:03,636 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 02:57:03,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:03,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 02:57:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:03,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:03,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {4210#true} call ULTIMATE.init(); {4210#true} is VALID [2022-04-28 02:57:03,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {4210#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(12, 2);call #Ultimate.allocInit(12, 3); {4210#true} is VALID [2022-04-28 02:57:03,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {4210#true} assume true; {4210#true} is VALID [2022-04-28 02:57:03,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4210#true} {4210#true} #34#return; {4210#true} is VALID [2022-04-28 02:57:03,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {4210#true} call #t~ret5 := main(); {4210#true} is VALID [2022-04-28 02:57:03,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {4210#true} ~x~0 := 1;~y~0 := 0; {4215#(= main_~y~0 0)} is VALID [2022-04-28 02:57:03,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {4215#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:03,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {4216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4217#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:03,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {4217#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4218#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:03,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {4218#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4219#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:03,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {4219#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4220#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:03,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {4220#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4221#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:03,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {4221#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4222#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:03,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {4222#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4223#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:03,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {4223#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4224#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:03,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {4224#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4225#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:03,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {4225#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4226#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:03,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {4226#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4227#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:03,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {4227#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4228#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:03,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {4228#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4229#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:03,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {4229#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4295#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:03,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {4295#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {4211#false} is VALID [2022-04-28 02:57:03,878 INFO L272 TraceCheckUtils]: 22: Hoare triple {4211#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {4211#false} is VALID [2022-04-28 02:57:03,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {4211#false} ~cond := #in~cond; {4211#false} is VALID [2022-04-28 02:57:03,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {4211#false} assume 0 == ~cond; {4211#false} is VALID [2022-04-28 02:57:03,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {4211#false} assume !false; {4211#false} is VALID [2022-04-28 02:57:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:03,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:04,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {4211#false} assume !false; {4211#false} is VALID [2022-04-28 02:57:04,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {4211#false} assume 0 == ~cond; {4211#false} is VALID [2022-04-28 02:57:04,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {4211#false} ~cond := #in~cond; {4211#false} is VALID [2022-04-28 02:57:04,332 INFO L272 TraceCheckUtils]: 22: Hoare triple {4211#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {4211#false} is VALID [2022-04-28 02:57:04,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {4323#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {4211#false} is VALID [2022-04-28 02:57:04,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {4327#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4323#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:04,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {4331#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4327#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {4335#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4331#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {4339#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4335#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {4343#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4339#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {4347#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4343#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {4351#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4347#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {4355#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4351#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {4359#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4355#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {4363#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4359#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {4367#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4363#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {4371#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4367#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {4375#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4371#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {4379#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4375#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {4383#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4379#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {4210#true} ~x~0 := 1;~y~0 := 0; {4383#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:57:04,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {4210#true} call #t~ret5 := main(); {4210#true} is VALID [2022-04-28 02:57:04,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4210#true} {4210#true} #34#return; {4210#true} is VALID [2022-04-28 02:57:04,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {4210#true} assume true; {4210#true} is VALID [2022-04-28 02:57:04,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {4210#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(12, 2);call #Ultimate.allocInit(12, 3); {4210#true} is VALID [2022-04-28 02:57:04,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {4210#true} call ULTIMATE.init(); {4210#true} is VALID [2022-04-28 02:57:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:04,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848813825] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:04,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:04,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 02:57:04,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:04,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1278521209] [2022-04-28 02:57:04,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1278521209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:04,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:04,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 02:57:04,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674289316] [2022-04-28 02:57:04,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:04,344 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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 26 [2022-04-28 02:57:04,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:04,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-28 02:57:04,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:04,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 02:57:04,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 02:57:04,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=903, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 02:57:04,362 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-28 02:57:05,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:05,061 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 02:57:05,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 02:57:05,061 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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 26 [2022-04-28 02:57:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-28 02:57:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-28 02:57:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-28 02:57:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-28 02:57:05,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2022-04-28 02:57:05,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:05,085 INFO L225 Difference]: With dead ends: 33 [2022-04-28 02:57:05,085 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 02:57:05,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=707, Invalid=1945, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 02:57:05,091 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:05,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:57:05,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 02:57:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 02:57:05,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:05,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,110 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,110 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:05,111 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 02:57:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 02:57:05,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:05,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:05,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 02:57:05,111 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 02:57:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:05,112 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 02:57:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 02:57:05,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:05,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:05,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:05,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-28 02:57:05,113 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-28 02:57:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:05,113 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-28 02:57:05,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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-28 02:57:05,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-28 02:57:05,136 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-28 02:57:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 02:57:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 02:57:05,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:05,136 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:05,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:05,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:05,337 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:05,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 31 times [2022-04-28 02:57:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:05,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1849644480] [2022-04-28 02:57:05,743 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:05,745 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash -980727625, now seen corresponding path program 1 times [2022-04-28 02:57:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:05,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318206961] [2022-04-28 02:57:05,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:05,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:57:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:05,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:57:05,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 32 times [2022-04-28 02:57:05,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:05,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858223853] [2022-04-28 02:57:05,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:05,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:05,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:05,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {4636#(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(12, 2);call #Ultimate.allocInit(12, 3); {4614#true} is VALID [2022-04-28 02:57:05,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {4614#true} assume true; {4614#true} is VALID [2022-04-28 02:57:05,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4614#true} {4614#true} #34#return; {4614#true} is VALID [2022-04-28 02:57:05,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {4614#true} call ULTIMATE.init(); {4636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:05,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {4636#(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(12, 2);call #Ultimate.allocInit(12, 3); {4614#true} is VALID [2022-04-28 02:57:05,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {4614#true} assume true; {4614#true} is VALID [2022-04-28 02:57:05,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4614#true} {4614#true} #34#return; {4614#true} is VALID [2022-04-28 02:57:05,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {4614#true} call #t~ret5 := main(); {4614#true} is VALID [2022-04-28 02:57:05,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {4614#true} ~x~0 := 1;~y~0 := 0; {4619#(= main_~y~0 0)} is VALID [2022-04-28 02:57:05,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {4619#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:05,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {4620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:05,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {4621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:05,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {4622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4623#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:05,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {4623#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4624#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:05,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {4624#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4625#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:06,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {4625#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4626#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:06,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {4626#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4627#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:06,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {4627#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4628#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:06,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {4628#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4629#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:06,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {4629#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4630#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:06,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {4630#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4631#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:06,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {4631#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4632#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:06,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {4632#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4633#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:06,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {4633#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4634#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:06,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {4634#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4635#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:06,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {4635#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 16))} assume !(~y~0 % 4294967296 < 1024); {4615#false} is VALID [2022-04-28 02:57:06,005 INFO L272 TraceCheckUtils]: 23: Hoare triple {4615#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {4615#false} is VALID [2022-04-28 02:57:06,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {4615#false} ~cond := #in~cond; {4615#false} is VALID [2022-04-28 02:57:06,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {4615#false} assume 0 == ~cond; {4615#false} is VALID [2022-04-28 02:57:06,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {4615#false} assume !false; {4615#false} is VALID [2022-04-28 02:57:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:06,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:06,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858223853] [2022-04-28 02:57:06,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858223853] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:06,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794823208] [2022-04-28 02:57:06,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:57:06,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:06,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:06,007 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:06,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 02:57:06,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:57:06,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:06,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 02:57:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:06,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:06,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {4614#true} call ULTIMATE.init(); {4614#true} is VALID [2022-04-28 02:57:06,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {4614#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(12, 2);call #Ultimate.allocInit(12, 3); {4614#true} is VALID [2022-04-28 02:57:06,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {4614#true} assume true; {4614#true} is VALID [2022-04-28 02:57:06,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4614#true} {4614#true} #34#return; {4614#true} is VALID [2022-04-28 02:57:06,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {4614#true} call #t~ret5 := main(); {4614#true} is VALID [2022-04-28 02:57:06,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {4614#true} ~x~0 := 1;~y~0 := 0; {4619#(= main_~y~0 0)} is VALID [2022-04-28 02:57:06,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {4619#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:06,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {4620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:06,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {4621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:06,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {4622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4623#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:06,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {4623#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4624#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:06,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {4624#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4625#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:06,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {4625#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4626#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:06,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {4626#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4627#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:06,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {4627#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4628#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:06,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {4628#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4629#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:06,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {4629#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4630#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:06,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {4630#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4631#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:06,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {4631#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4632#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:06,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {4632#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4633#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:06,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {4633#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4634#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:06,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {4634#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4703#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:06,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {4703#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~y~0 % 4294967296 < 1024); {4615#false} is VALID [2022-04-28 02:57:06,311 INFO L272 TraceCheckUtils]: 23: Hoare triple {4615#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {4615#false} is VALID [2022-04-28 02:57:06,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {4615#false} ~cond := #in~cond; {4615#false} is VALID [2022-04-28 02:57:06,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {4615#false} assume 0 == ~cond; {4615#false} is VALID [2022-04-28 02:57:06,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {4615#false} assume !false; {4615#false} is VALID [2022-04-28 02:57:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:06,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:06,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {4615#false} assume !false; {4615#false} is VALID [2022-04-28 02:57:06,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {4615#false} assume 0 == ~cond; {4615#false} is VALID [2022-04-28 02:57:06,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {4615#false} ~cond := #in~cond; {4615#false} is VALID [2022-04-28 02:57:06,811 INFO L272 TraceCheckUtils]: 23: Hoare triple {4615#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {4615#false} is VALID [2022-04-28 02:57:06,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {4731#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {4615#false} is VALID [2022-04-28 02:57:06,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {4735#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4731#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:06,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {4739#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4735#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {4743#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4739#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {4747#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4743#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {4751#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4747#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {4755#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4751#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {4759#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4755#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {4763#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4759#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {4767#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4763#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {4771#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4767#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {4775#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4771#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {4779#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4775#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {4783#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4779#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {4787#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4783#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {4791#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4787#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {4795#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4791#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {4614#true} ~x~0 := 1;~y~0 := 0; {4795#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:57:06,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {4614#true} call #t~ret5 := main(); {4614#true} is VALID [2022-04-28 02:57:06,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4614#true} {4614#true} #34#return; {4614#true} is VALID [2022-04-28 02:57:06,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {4614#true} assume true; {4614#true} is VALID [2022-04-28 02:57:06,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {4614#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(12, 2);call #Ultimate.allocInit(12, 3); {4614#true} is VALID [2022-04-28 02:57:06,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {4614#true} call ULTIMATE.init(); {4614#true} is VALID [2022-04-28 02:57:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:06,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794823208] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:06,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:06,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 02:57:06,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:06,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1849644480] [2022-04-28 02:57:06,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1849644480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:06,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:06,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 02:57:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914636481] [2022-04-28 02:57:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:06,823 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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 27 [2022-04-28 02:57:06,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:06,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-28 02:57:06,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:06,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 02:57:06,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:06,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 02:57:06,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1010, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 02:57:06,838 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-28 02:57:07,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:07,582 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 02:57:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 02:57:07,582 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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 27 [2022-04-28 02:57:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-28 02:57:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-28 02:57:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-28 02:57:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-28 02:57:07,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-28 02:57:07,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:07,605 INFO L225 Difference]: With dead ends: 34 [2022-04-28 02:57:07,605 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 02:57:07,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=785, Invalid=2185, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 02:57:07,606 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:07,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:57:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 02:57:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 02:57:07,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:07,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-28 02:57:07,630 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-28 02:57:07,630 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-28 02:57:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:07,630 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 02:57:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 02:57:07,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:07,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:07,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 29 states. [2022-04-28 02:57:07,631 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 29 states. [2022-04-28 02:57:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:07,631 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 02:57:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 02:57:07,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:07,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:07,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:07,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-28 02:57:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 02:57:07,632 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-28 02:57:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:07,632 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 02:57:07,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-28 02:57:07,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 02:57:07,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 02:57:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 02:57:07,669 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:07,669 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:07,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:07,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33 [2022-04-28 02:57:07,887 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 33 times [2022-04-28 02:57:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:07,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [964757303] [2022-04-28 02:57:09,355 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:09,514 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:09,515 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash -921622281, now seen corresponding path program 1 times [2022-04-28 02:57:09,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:09,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873968748] [2022-04-28 02:57:09,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:09,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:09,522 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:57:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:09,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:57:09,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 34 times [2022-04-28 02:57:09,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:09,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730270341] [2022-04-28 02:57:09,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:09,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:09,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:09,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {5057#(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(12, 2);call #Ultimate.allocInit(12, 3); {5034#true} is VALID [2022-04-28 02:57:09,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {5034#true} assume true; {5034#true} is VALID [2022-04-28 02:57:09,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5034#true} {5034#true} #34#return; {5034#true} is VALID [2022-04-28 02:57:09,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {5034#true} call ULTIMATE.init(); {5057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:09,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {5057#(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(12, 2);call #Ultimate.allocInit(12, 3); {5034#true} is VALID [2022-04-28 02:57:09,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {5034#true} assume true; {5034#true} is VALID [2022-04-28 02:57:09,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5034#true} {5034#true} #34#return; {5034#true} is VALID [2022-04-28 02:57:09,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {5034#true} call #t~ret5 := main(); {5034#true} is VALID [2022-04-28 02:57:09,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {5034#true} ~x~0 := 1;~y~0 := 0; {5039#(= main_~y~0 0)} is VALID [2022-04-28 02:57:09,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {5039#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5040#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:09,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {5040#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5041#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:09,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {5041#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5042#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:09,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {5042#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5043#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:09,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {5043#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5044#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:09,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {5044#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5045#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:09,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {5045#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5046#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:09,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {5046#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5047#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:09,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {5047#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5048#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:09,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {5048#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5049#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:09,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {5049#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5050#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:09,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {5050#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5051#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:09,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {5051#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5052#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:09,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {5052#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5053#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:09,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {5053#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5054#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:09,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {5054#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5055#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:09,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {5055#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5056#(and (<= main_~y~0 17) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:57:09,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {5056#(and (<= main_~y~0 17) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {5035#false} is VALID [2022-04-28 02:57:09,800 INFO L272 TraceCheckUtils]: 24: Hoare triple {5035#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {5035#false} is VALID [2022-04-28 02:57:09,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {5035#false} ~cond := #in~cond; {5035#false} is VALID [2022-04-28 02:57:09,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {5035#false} assume 0 == ~cond; {5035#false} is VALID [2022-04-28 02:57:09,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {5035#false} assume !false; {5035#false} is VALID [2022-04-28 02:57:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:09,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:09,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730270341] [2022-04-28 02:57:09,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730270341] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:09,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489856582] [2022-04-28 02:57:09,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:57:09,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:09,801 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:09,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 02:57:09,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:57:09,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:09,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 02:57:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:09,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:10,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {5034#true} call ULTIMATE.init(); {5034#true} is VALID [2022-04-28 02:57:10,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {5034#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(12, 2);call #Ultimate.allocInit(12, 3); {5034#true} is VALID [2022-04-28 02:57:10,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {5034#true} assume true; {5034#true} is VALID [2022-04-28 02:57:10,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5034#true} {5034#true} #34#return; {5034#true} is VALID [2022-04-28 02:57:10,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {5034#true} call #t~ret5 := main(); {5034#true} is VALID [2022-04-28 02:57:10,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {5034#true} ~x~0 := 1;~y~0 := 0; {5039#(= main_~y~0 0)} is VALID [2022-04-28 02:57:10,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {5039#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5040#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:10,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {5040#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5041#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:10,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {5041#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5042#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:10,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {5042#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5043#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:10,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {5043#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5044#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:10,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {5044#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5045#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:10,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {5045#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5046#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:10,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {5046#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5047#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:10,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {5047#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5048#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:10,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {5048#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5049#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:10,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {5049#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5050#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:10,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {5050#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5051#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:10,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {5051#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5052#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:10,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {5052#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5053#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:10,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {5053#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5054#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:10,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {5054#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5055#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:10,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {5055#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5127#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:10,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {5127#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {5035#false} is VALID [2022-04-28 02:57:10,139 INFO L272 TraceCheckUtils]: 24: Hoare triple {5035#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {5035#false} is VALID [2022-04-28 02:57:10,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {5035#false} ~cond := #in~cond; {5035#false} is VALID [2022-04-28 02:57:10,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {5035#false} assume 0 == ~cond; {5035#false} is VALID [2022-04-28 02:57:10,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {5035#false} assume !false; {5035#false} is VALID [2022-04-28 02:57:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:10,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:10,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {5035#false} assume !false; {5035#false} is VALID [2022-04-28 02:57:10,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {5035#false} assume 0 == ~cond; {5035#false} is VALID [2022-04-28 02:57:10,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {5035#false} ~cond := #in~cond; {5035#false} is VALID [2022-04-28 02:57:10,689 INFO L272 TraceCheckUtils]: 24: Hoare triple {5035#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {5035#false} is VALID [2022-04-28 02:57:10,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {5155#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {5035#false} is VALID [2022-04-28 02:57:10,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {5159#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5155#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:10,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {5163#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5159#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {5167#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5163#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {5171#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5167#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {5175#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5171#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {5179#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5175#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {5183#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5179#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {5187#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5183#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {5191#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5187#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {5195#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5191#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {5199#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5195#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {5203#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5199#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {5207#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5203#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {5211#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5207#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {5215#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5211#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {5219#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5215#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {5223#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5219#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {5034#true} ~x~0 := 1;~y~0 := 0; {5223#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:57:10,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {5034#true} call #t~ret5 := main(); {5034#true} is VALID [2022-04-28 02:57:10,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5034#true} {5034#true} #34#return; {5034#true} is VALID [2022-04-28 02:57:10,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {5034#true} assume true; {5034#true} is VALID [2022-04-28 02:57:10,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {5034#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(12, 2);call #Ultimate.allocInit(12, 3); {5034#true} is VALID [2022-04-28 02:57:10,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {5034#true} call ULTIMATE.init(); {5034#true} is VALID [2022-04-28 02:57:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:10,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489856582] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:10,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:10,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 02:57:10,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:10,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [964757303] [2022-04-28 02:57:10,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [964757303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:10,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:10,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 02:57:10,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718074234] [2022-04-28 02:57:10,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:10,702 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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 28 [2022-04-28 02:57:10,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:10,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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-28 02:57:10,717 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-28 02:57:10,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 02:57:10,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:10,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 02:57:10,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 02:57:10,719 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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-28 02:57:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:11,571 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 02:57:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 02:57:11,571 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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 28 [2022-04-28 02:57:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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-28 02:57:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-28 02:57:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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-28 02:57:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-28 02:57:11,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2022-04-28 02:57:11,605 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-28 02:57:11,605 INFO L225 Difference]: With dead ends: 35 [2022-04-28 02:57:11,605 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 02:57:11,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=867, Invalid=2439, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 02:57:11,607 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:11,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:57:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 02:57:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 02:57:11,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:11,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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-28 02:57:11,635 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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-28 02:57:11,635 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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-28 02:57:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:11,636 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 02:57:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 02:57:11,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:11,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:11,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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 30 states. [2022-04-28 02:57:11,636 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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 30 states. [2022-04-28 02:57:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:11,636 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 02:57:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 02:57:11,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:11,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:11,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:11,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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-28 02:57:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-28 02:57:11,637 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-28 02:57:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:11,637 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-28 02:57:11,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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-28 02:57:11,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-28 02:57:11,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 02:57:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 02:57:11,660 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:11,660 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:11,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:11,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:11,860 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 35 times [2022-04-28 02:57:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:11,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1534019187] [2022-04-28 02:57:13,031 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:13,175 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:13,176 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash -862516937, now seen corresponding path program 1 times [2022-04-28 02:57:13,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:13,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262264214] [2022-04-28 02:57:13,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:13,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:13,186 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:57:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:13,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:57:13,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 36 times [2022-04-28 02:57:13,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:13,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347694127] [2022-04-28 02:57:13,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:13,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:13,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:13,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {5494#(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(12, 2);call #Ultimate.allocInit(12, 3); {5470#true} is VALID [2022-04-28 02:57:13,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {5470#true} assume true; {5470#true} is VALID [2022-04-28 02:57:13,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5470#true} {5470#true} #34#return; {5470#true} is VALID [2022-04-28 02:57:13,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {5470#true} call ULTIMATE.init(); {5494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:13,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {5494#(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(12, 2);call #Ultimate.allocInit(12, 3); {5470#true} is VALID [2022-04-28 02:57:13,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {5470#true} assume true; {5470#true} is VALID [2022-04-28 02:57:13,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5470#true} {5470#true} #34#return; {5470#true} is VALID [2022-04-28 02:57:13,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {5470#true} call #t~ret5 := main(); {5470#true} is VALID [2022-04-28 02:57:13,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {5470#true} ~x~0 := 1;~y~0 := 0; {5475#(= main_~y~0 0)} is VALID [2022-04-28 02:57:13,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {5475#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5476#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:13,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {5476#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5477#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:13,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {5477#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5478#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:13,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {5478#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5479#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:13,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {5479#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5480#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:13,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {5480#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5481#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:13,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {5481#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5482#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:13,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {5482#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5483#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:13,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {5483#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5484#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:13,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {5484#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5485#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:13,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {5485#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5486#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:13,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {5486#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5487#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:13,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {5487#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5488#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:13,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {5488#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5489#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:13,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {5489#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5490#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:13,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {5490#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5491#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:13,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {5491#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5492#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:13,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {5492#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5493#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:13,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {5493#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 18))} assume !(~y~0 % 4294967296 < 1024); {5471#false} is VALID [2022-04-28 02:57:13,493 INFO L272 TraceCheckUtils]: 25: Hoare triple {5471#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {5471#false} is VALID [2022-04-28 02:57:13,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {5471#false} ~cond := #in~cond; {5471#false} is VALID [2022-04-28 02:57:13,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {5471#false} assume 0 == ~cond; {5471#false} is VALID [2022-04-28 02:57:13,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {5471#false} assume !false; {5471#false} is VALID [2022-04-28 02:57:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:13,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:13,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347694127] [2022-04-28 02:57:13,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347694127] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:13,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247547451] [2022-04-28 02:57:13,493 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:57:13,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:13,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:13,494 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:13,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 02:57:13,629 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 02:57:13,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:13,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 02:57:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:13,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:13,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {5470#true} call ULTIMATE.init(); {5470#true} is VALID [2022-04-28 02:57:13,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {5470#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(12, 2);call #Ultimate.allocInit(12, 3); {5470#true} is VALID [2022-04-28 02:57:13,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {5470#true} assume true; {5470#true} is VALID [2022-04-28 02:57:13,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5470#true} {5470#true} #34#return; {5470#true} is VALID [2022-04-28 02:57:13,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {5470#true} call #t~ret5 := main(); {5470#true} is VALID [2022-04-28 02:57:13,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {5470#true} ~x~0 := 1;~y~0 := 0; {5475#(= main_~y~0 0)} is VALID [2022-04-28 02:57:13,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {5475#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5476#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:13,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {5476#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5477#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:13,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {5477#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5478#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:13,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {5478#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5479#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:13,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {5479#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5480#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:13,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {5480#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5481#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:13,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {5481#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5482#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:13,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {5482#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5483#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:13,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {5483#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5484#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:13,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {5484#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5485#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:13,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {5485#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5486#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:13,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {5486#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5487#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:13,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {5487#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5488#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:13,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {5488#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5489#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:13,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {5489#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5490#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:13,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {5490#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5491#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:13,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {5491#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5492#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:13,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {5492#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5567#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:13,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {5567#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~y~0 % 4294967296 < 1024); {5471#false} is VALID [2022-04-28 02:57:13,946 INFO L272 TraceCheckUtils]: 25: Hoare triple {5471#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {5471#false} is VALID [2022-04-28 02:57:13,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {5471#false} ~cond := #in~cond; {5471#false} is VALID [2022-04-28 02:57:13,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {5471#false} assume 0 == ~cond; {5471#false} is VALID [2022-04-28 02:57:13,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {5471#false} assume !false; {5471#false} is VALID [2022-04-28 02:57:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:13,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:14,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {5471#false} assume !false; {5471#false} is VALID [2022-04-28 02:57:14,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {5471#false} assume 0 == ~cond; {5471#false} is VALID [2022-04-28 02:57:14,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {5471#false} ~cond := #in~cond; {5471#false} is VALID [2022-04-28 02:57:14,566 INFO L272 TraceCheckUtils]: 25: Hoare triple {5471#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {5471#false} is VALID [2022-04-28 02:57:14,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {5595#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {5471#false} is VALID [2022-04-28 02:57:14,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {5599#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5595#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:14,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {5603#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5599#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {5607#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5603#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {5611#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5607#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {5615#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5611#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {5619#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5615#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {5623#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5619#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {5627#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5623#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {5631#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5627#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {5635#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5631#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {5639#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5635#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {5643#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5639#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {5647#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5643#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {5651#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5647#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {5655#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5651#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {5659#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5655#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {5663#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5659#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {5667#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5663#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {5470#true} ~x~0 := 1;~y~0 := 0; {5667#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:57:14,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {5470#true} call #t~ret5 := main(); {5470#true} is VALID [2022-04-28 02:57:14,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5470#true} {5470#true} #34#return; {5470#true} is VALID [2022-04-28 02:57:14,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {5470#true} assume true; {5470#true} is VALID [2022-04-28 02:57:14,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {5470#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(12, 2);call #Ultimate.allocInit(12, 3); {5470#true} is VALID [2022-04-28 02:57:14,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {5470#true} call ULTIMATE.init(); {5470#true} is VALID [2022-04-28 02:57:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:14,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247547451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:14,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:14,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 02:57:14,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:14,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1534019187] [2022-04-28 02:57:14,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1534019187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:14,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:14,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 02:57:14,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050574261] [2022-04-28 02:57:14,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:14,580 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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 29 [2022-04-28 02:57:14,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:14,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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-28 02:57:14,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:14,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 02:57:14,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:14,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 02:57:14,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=1242, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 02:57:14,597 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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-28 02:57:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:15,502 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 02:57:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 02:57:15,502 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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 29 [2022-04-28 02:57:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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-28 02:57:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-28 02:57:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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-28 02:57:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-28 02:57:15,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-28 02:57:15,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:15,528 INFO L225 Difference]: With dead ends: 36 [2022-04-28 02:57:15,528 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 02:57:15,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=953, Invalid=2707, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 02:57:15,529 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:15,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:57:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 02:57:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 02:57:15,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:15,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-28 02:57:15,553 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-28 02:57:15,553 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-28 02:57:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:15,554 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 02:57:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 02:57:15,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:15,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:15,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 31 states. [2022-04-28 02:57:15,554 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 31 states. [2022-04-28 02:57:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:15,555 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 02:57:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 02:57:15,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:15,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:15,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:15,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-28 02:57:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 02:57:15,556 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-28 02:57:15,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:15,556 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 02:57:15,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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-28 02:57:15,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 02:57:15,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 02:57:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 02:57:15,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:15,582 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:15,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 02:57:15,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 02:57:15,786 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:15,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 37 times [2022-04-28 02:57:15,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:15,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1886519596] [2022-04-28 02:57:17,202 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:17,317 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:17,318 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:17,319 INFO L85 PathProgramCache]: Analyzing trace with hash -803411593, now seen corresponding path program 1 times [2022-04-28 02:57:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:17,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7265570] [2022-04-28 02:57:17,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:17,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:17,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:57:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:17,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:57:17,328 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 38 times [2022-04-28 02:57:17,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:17,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382820186] [2022-04-28 02:57:17,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:17,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:17,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:17,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {5947#(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(12, 2);call #Ultimate.allocInit(12, 3); {5922#true} is VALID [2022-04-28 02:57:17,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {5922#true} assume true; {5922#true} is VALID [2022-04-28 02:57:17,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5922#true} {5922#true} #34#return; {5922#true} is VALID [2022-04-28 02:57:17,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {5922#true} call ULTIMATE.init(); {5947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:17,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {5947#(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(12, 2);call #Ultimate.allocInit(12, 3); {5922#true} is VALID [2022-04-28 02:57:17,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {5922#true} assume true; {5922#true} is VALID [2022-04-28 02:57:17,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5922#true} {5922#true} #34#return; {5922#true} is VALID [2022-04-28 02:57:17,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {5922#true} call #t~ret5 := main(); {5922#true} is VALID [2022-04-28 02:57:17,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {5922#true} ~x~0 := 1;~y~0 := 0; {5927#(= main_~y~0 0)} is VALID [2022-04-28 02:57:17,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {5927#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5928#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:17,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {5928#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5929#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:17,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {5929#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:17,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {5930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5931#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:17,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {5931#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5932#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:17,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {5932#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5933#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:17,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {5933#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5934#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:17,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {5934#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5935#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:17,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {5935#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5936#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:17,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {5936#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5937#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:17,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {5937#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5938#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:17,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {5938#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5939#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:17,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {5939#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5940#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:17,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {5940#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5941#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:17,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {5941#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5942#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:17,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {5942#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5943#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:17,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {5943#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5944#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:17,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {5944#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5945#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:17,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {5945#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5946#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:17,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {5946#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 19))} assume !(~y~0 % 4294967296 < 1024); {5923#false} is VALID [2022-04-28 02:57:17,647 INFO L272 TraceCheckUtils]: 26: Hoare triple {5923#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {5923#false} is VALID [2022-04-28 02:57:17,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {5923#false} ~cond := #in~cond; {5923#false} is VALID [2022-04-28 02:57:17,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {5923#false} assume 0 == ~cond; {5923#false} is VALID [2022-04-28 02:57:17,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {5923#false} assume !false; {5923#false} is VALID [2022-04-28 02:57:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:17,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:17,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382820186] [2022-04-28 02:57:17,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382820186] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:17,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532879539] [2022-04-28 02:57:17,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:57:17,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:17,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:17,649 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:17,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 02:57:17,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:57:17,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:17,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 02:57:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:17,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:17,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {5922#true} call ULTIMATE.init(); {5922#true} is VALID [2022-04-28 02:57:17,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {5922#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(12, 2);call #Ultimate.allocInit(12, 3); {5922#true} is VALID [2022-04-28 02:57:17,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {5922#true} assume true; {5922#true} is VALID [2022-04-28 02:57:17,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5922#true} {5922#true} #34#return; {5922#true} is VALID [2022-04-28 02:57:17,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {5922#true} call #t~ret5 := main(); {5922#true} is VALID [2022-04-28 02:57:17,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {5922#true} ~x~0 := 1;~y~0 := 0; {5927#(= main_~y~0 0)} is VALID [2022-04-28 02:57:17,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {5927#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5928#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:17,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {5928#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5929#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:17,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {5929#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:17,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {5930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5931#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:17,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {5931#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5932#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:17,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {5932#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5933#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:17,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {5933#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5934#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:17,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {5934#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5935#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:17,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {5935#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5936#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:17,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {5936#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5937#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:17,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {5937#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5938#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:17,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {5938#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5939#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:17,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {5939#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5940#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:17,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {5940#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5941#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:17,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {5941#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5942#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:17,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {5942#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5943#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:17,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {5943#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5944#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:17,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {5944#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {5945#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:17,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {5945#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6023#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:17,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {6023#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~y~0 % 4294967296 < 1024); {5923#false} is VALID [2022-04-28 02:57:17,980 INFO L272 TraceCheckUtils]: 26: Hoare triple {5923#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {5923#false} is VALID [2022-04-28 02:57:17,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {5923#false} ~cond := #in~cond; {5923#false} is VALID [2022-04-28 02:57:17,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {5923#false} assume 0 == ~cond; {5923#false} is VALID [2022-04-28 02:57:17,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {5923#false} assume !false; {5923#false} is VALID [2022-04-28 02:57:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:17,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:18,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {5923#false} assume !false; {5923#false} is VALID [2022-04-28 02:57:18,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {5923#false} assume 0 == ~cond; {5923#false} is VALID [2022-04-28 02:57:18,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {5923#false} ~cond := #in~cond; {5923#false} is VALID [2022-04-28 02:57:18,648 INFO L272 TraceCheckUtils]: 26: Hoare triple {5923#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {5923#false} is VALID [2022-04-28 02:57:18,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {6051#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {5923#false} is VALID [2022-04-28 02:57:18,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {6055#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6051#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:18,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {6059#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6055#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {6063#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6059#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {6067#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6063#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {6071#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6067#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {6075#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6071#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {6079#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6075#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {6083#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6079#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {6087#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6083#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {6091#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6087#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {6095#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6091#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {6099#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6095#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {6103#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6099#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {6107#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6103#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {6111#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6107#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {6115#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6111#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {6119#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6115#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {6123#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6119#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {6127#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6123#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {5922#true} ~x~0 := 1;~y~0 := 0; {6127#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:18,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {5922#true} call #t~ret5 := main(); {5922#true} is VALID [2022-04-28 02:57:18,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5922#true} {5922#true} #34#return; {5922#true} is VALID [2022-04-28 02:57:18,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {5922#true} assume true; {5922#true} is VALID [2022-04-28 02:57:18,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {5922#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(12, 2);call #Ultimate.allocInit(12, 3); {5922#true} is VALID [2022-04-28 02:57:18,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {5922#true} call ULTIMATE.init(); {5922#true} is VALID [2022-04-28 02:57:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:18,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532879539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:18,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:18,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 02:57:18,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:18,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1886519596] [2022-04-28 02:57:18,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1886519596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:18,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:18,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 02:57:18,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114664282] [2022-04-28 02:57:18,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:18,662 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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 30 [2022-04-28 02:57:18,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:18,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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-28 02:57:18,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:18,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 02:57:18,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:18,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 02:57:18,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=1367, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 02:57:18,680 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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-28 02:57:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:19,517 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 02:57:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 02:57:19,518 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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 30 [2022-04-28 02:57:19,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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-28 02:57:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-28 02:57:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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-28 02:57:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-28 02:57:19,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2022-04-28 02:57:19,543 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-28 02:57:19,543 INFO L225 Difference]: With dead ends: 37 [2022-04-28 02:57:19,543 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 02:57:19,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1043, Invalid=2989, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 02:57:19,545 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:19,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:57:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 02:57:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 02:57:19,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:19,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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-28 02:57:19,569 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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-28 02:57:19,569 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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-28 02:57:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:19,569 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 02:57:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 02:57:19,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:19,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:19,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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-28 02:57:19,570 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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-28 02:57:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:19,570 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 02:57:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 02:57:19,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:19,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:19,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:19,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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-28 02:57:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-28 02:57:19,571 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-28 02:57:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:19,571 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-28 02:57:19,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 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-28 02:57:19,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-28 02:57:19,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 02:57:19,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 02:57:19,594 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:19,594 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:19,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:19,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 02:57:19,795 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:19,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 39 times [2022-04-28 02:57:19,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:19,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17895065] [2022-04-28 02:57:22,390 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:22,534 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:22,535 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash -744306249, now seen corresponding path program 1 times [2022-04-28 02:57:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:22,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588673639] [2022-04-28 02:57:22,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:22,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:22,542 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:57:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:22,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:57:22,546 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 40 times [2022-04-28 02:57:22,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:22,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486111779] [2022-04-28 02:57:22,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:22,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:22,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:22,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {6416#(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(12, 2);call #Ultimate.allocInit(12, 3); {6390#true} is VALID [2022-04-28 02:57:22,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {6390#true} assume true; {6390#true} is VALID [2022-04-28 02:57:22,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6390#true} {6390#true} #34#return; {6390#true} is VALID [2022-04-28 02:57:22,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {6390#true} call ULTIMATE.init(); {6416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:22,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {6416#(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(12, 2);call #Ultimate.allocInit(12, 3); {6390#true} is VALID [2022-04-28 02:57:22,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {6390#true} assume true; {6390#true} is VALID [2022-04-28 02:57:22,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6390#true} {6390#true} #34#return; {6390#true} is VALID [2022-04-28 02:57:22,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {6390#true} call #t~ret5 := main(); {6390#true} is VALID [2022-04-28 02:57:22,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {6390#true} ~x~0 := 1;~y~0 := 0; {6395#(= main_~y~0 0)} is VALID [2022-04-28 02:57:22,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {6395#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6396#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:22,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {6396#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6397#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:22,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {6397#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6398#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:22,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {6398#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6399#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:22,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {6399#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6400#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:22,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {6400#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6401#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:22,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {6401#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6402#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:22,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {6402#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6403#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:22,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {6403#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6404#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:22,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {6404#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6405#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:22,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {6405#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6406#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:22,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {6406#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6407#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:22,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {6407#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6408#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:22,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {6408#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6409#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:22,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {6409#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6410#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:22,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {6410#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6411#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:22,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {6411#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6412#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:22,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {6412#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6413#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:22,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {6413#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6414#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:22,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {6414#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6415#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:22,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {6415#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 20))} assume !(~y~0 % 4294967296 < 1024); {6391#false} is VALID [2022-04-28 02:57:22,900 INFO L272 TraceCheckUtils]: 27: Hoare triple {6391#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {6391#false} is VALID [2022-04-28 02:57:22,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {6391#false} ~cond := #in~cond; {6391#false} is VALID [2022-04-28 02:57:22,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {6391#false} assume 0 == ~cond; {6391#false} is VALID [2022-04-28 02:57:22,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {6391#false} assume !false; {6391#false} is VALID [2022-04-28 02:57:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:22,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486111779] [2022-04-28 02:57:22,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486111779] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117076704] [2022-04-28 02:57:22,900 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:57:22,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:22,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:22,901 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:22,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 02:57:22,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:57:22,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:22,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 02:57:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:22,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:23,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {6390#true} call ULTIMATE.init(); {6390#true} is VALID [2022-04-28 02:57:23,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {6390#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(12, 2);call #Ultimate.allocInit(12, 3); {6390#true} is VALID [2022-04-28 02:57:23,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {6390#true} assume true; {6390#true} is VALID [2022-04-28 02:57:23,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6390#true} {6390#true} #34#return; {6390#true} is VALID [2022-04-28 02:57:23,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {6390#true} call #t~ret5 := main(); {6390#true} is VALID [2022-04-28 02:57:23,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {6390#true} ~x~0 := 1;~y~0 := 0; {6395#(= main_~y~0 0)} is VALID [2022-04-28 02:57:23,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {6395#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6396#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:23,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {6396#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6397#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:23,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {6397#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6398#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:23,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {6398#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6399#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:23,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {6399#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6400#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:23,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {6400#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6401#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:23,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {6401#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6402#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:23,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {6402#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6403#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:23,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {6403#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6404#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:23,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {6404#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6405#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:23,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {6405#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6406#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:23,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {6406#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6407#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:23,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {6407#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6408#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:23,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {6408#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6409#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:23,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {6409#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6410#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:23,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {6410#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6411#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:23,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {6411#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6412#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:23,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {6412#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6413#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:23,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {6413#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6414#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:23,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {6414#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6495#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:23,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {6495#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~y~0 % 4294967296 < 1024); {6391#false} is VALID [2022-04-28 02:57:23,230 INFO L272 TraceCheckUtils]: 27: Hoare triple {6391#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {6391#false} is VALID [2022-04-28 02:57:23,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {6391#false} ~cond := #in~cond; {6391#false} is VALID [2022-04-28 02:57:23,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {6391#false} assume 0 == ~cond; {6391#false} is VALID [2022-04-28 02:57:23,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {6391#false} assume !false; {6391#false} is VALID [2022-04-28 02:57:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:23,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:23,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {6391#false} assume !false; {6391#false} is VALID [2022-04-28 02:57:23,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {6391#false} assume 0 == ~cond; {6391#false} is VALID [2022-04-28 02:57:23,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {6391#false} ~cond := #in~cond; {6391#false} is VALID [2022-04-28 02:57:23,954 INFO L272 TraceCheckUtils]: 27: Hoare triple {6391#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {6391#false} is VALID [2022-04-28 02:57:23,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {6523#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {6391#false} is VALID [2022-04-28 02:57:23,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {6527#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6523#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:23,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {6531#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6527#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {6535#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6531#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {6539#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6535#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {6543#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6539#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {6547#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6543#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {6551#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6547#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {6555#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6551#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {6559#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6555#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {6563#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6559#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {6567#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6563#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {6571#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6567#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {6575#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6571#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {6579#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6575#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {6583#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6579#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {6587#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6583#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {6591#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6587#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {6595#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6591#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {6599#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6595#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {6603#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6599#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {6390#true} ~x~0 := 1;~y~0 := 0; {6603#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:57:23,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {6390#true} call #t~ret5 := main(); {6390#true} is VALID [2022-04-28 02:57:23,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6390#true} {6390#true} #34#return; {6390#true} is VALID [2022-04-28 02:57:23,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {6390#true} assume true; {6390#true} is VALID [2022-04-28 02:57:23,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {6390#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(12, 2);call #Ultimate.allocInit(12, 3); {6390#true} is VALID [2022-04-28 02:57:23,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {6390#true} call ULTIMATE.init(); {6390#true} is VALID [2022-04-28 02:57:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:23,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117076704] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:23,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:23,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 02:57:23,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:23,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17895065] [2022-04-28 02:57:23,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17895065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:23,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:23,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 02:57:23,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323472636] [2022-04-28 02:57:23,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:23,971 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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 31 [2022-04-28 02:57:23,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:23,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-28 02:57:23,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:23,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 02:57:23,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:23,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 02:57:23,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 02:57:23,989 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-28 02:57:24,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:24,924 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 02:57:24,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 02:57:24,924 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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 31 [2022-04-28 02:57:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-28 02:57:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-28 02:57:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-28 02:57:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-28 02:57:24,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-28 02:57:24,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:24,948 INFO L225 Difference]: With dead ends: 38 [2022-04-28 02:57:24,948 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 02:57:24,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1137, Invalid=3285, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 02:57:24,950 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:24,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:57:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 02:57:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 02:57:24,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:24,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-28 02:57:24,975 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-28 02:57:24,975 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-28 02:57:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:24,975 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 02:57:24,975 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 02:57:24,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:24,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:24,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 33 states. [2022-04-28 02:57:24,976 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 33 states. [2022-04-28 02:57:24,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:24,976 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 02:57:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 02:57:24,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:24,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:24,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:24,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-28 02:57:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-28 02:57:24,977 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-28 02:57:24,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:24,977 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-28 02:57:24,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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-28 02:57:24,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-28 02:57:25,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 02:57:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 02:57:25,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:25,003 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:25,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:25,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41 [2022-04-28 02:57:25,203 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:25,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 41 times [2022-04-28 02:57:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:25,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [762140323] [2022-04-28 02:57:26,613 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:26,740 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:26,741 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash -685200905, now seen corresponding path program 1 times [2022-04-28 02:57:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:26,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701788388] [2022-04-28 02:57:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:26,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:57:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:26,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:57:26,755 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 42 times [2022-04-28 02:57:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:26,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545920229] [2022-04-28 02:57:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:27,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {6901#(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(12, 2);call #Ultimate.allocInit(12, 3); {6874#true} is VALID [2022-04-28 02:57:27,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {6874#true} assume true; {6874#true} is VALID [2022-04-28 02:57:27,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6874#true} {6874#true} #34#return; {6874#true} is VALID [2022-04-28 02:57:27,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {6874#true} call ULTIMATE.init(); {6901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:27,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {6901#(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(12, 2);call #Ultimate.allocInit(12, 3); {6874#true} is VALID [2022-04-28 02:57:27,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {6874#true} assume true; {6874#true} is VALID [2022-04-28 02:57:27,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6874#true} {6874#true} #34#return; {6874#true} is VALID [2022-04-28 02:57:27,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {6874#true} call #t~ret5 := main(); {6874#true} is VALID [2022-04-28 02:57:27,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {6874#true} ~x~0 := 1;~y~0 := 0; {6879#(= main_~y~0 0)} is VALID [2022-04-28 02:57:27,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {6879#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:27,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {6880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:27,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {6881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:27,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {6882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:27,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {6883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:27,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {6884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:27,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {6885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:27,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {6886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:27,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {6887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:27,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {6888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:27,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {6889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:27,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {6890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:27,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {6891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6892#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:27,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {6892#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6893#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:27,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {6893#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6894#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:27,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {6894#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6895#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:27,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {6895#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6896#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:27,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {6896#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6897#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:27,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {6897#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6898#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:27,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {6898#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6899#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:27,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {6899#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6900#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 21))} is VALID [2022-04-28 02:57:27,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {6900#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 21))} assume !(~y~0 % 4294967296 < 1024); {6875#false} is VALID [2022-04-28 02:57:27,110 INFO L272 TraceCheckUtils]: 28: Hoare triple {6875#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {6875#false} is VALID [2022-04-28 02:57:27,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {6875#false} ~cond := #in~cond; {6875#false} is VALID [2022-04-28 02:57:27,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {6875#false} assume 0 == ~cond; {6875#false} is VALID [2022-04-28 02:57:27,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {6875#false} assume !false; {6875#false} is VALID [2022-04-28 02:57:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:27,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:27,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545920229] [2022-04-28 02:57:27,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545920229] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:27,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586753204] [2022-04-28 02:57:27,111 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:57:27,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:27,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:27,112 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:27,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 02:57:27,307 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 02:57:27,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:27,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 02:57:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:27,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:27,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {6874#true} call ULTIMATE.init(); {6874#true} is VALID [2022-04-28 02:57:27,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {6874#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(12, 2);call #Ultimate.allocInit(12, 3); {6874#true} is VALID [2022-04-28 02:57:27,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {6874#true} assume true; {6874#true} is VALID [2022-04-28 02:57:27,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6874#true} {6874#true} #34#return; {6874#true} is VALID [2022-04-28 02:57:27,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {6874#true} call #t~ret5 := main(); {6874#true} is VALID [2022-04-28 02:57:27,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {6874#true} ~x~0 := 1;~y~0 := 0; {6879#(= main_~y~0 0)} is VALID [2022-04-28 02:57:27,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {6879#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:27,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {6880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:27,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {6881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:27,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {6882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:27,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {6883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:27,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {6884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:27,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {6885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:27,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {6886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:27,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {6887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:27,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {6888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:27,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {6889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:27,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {6890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:27,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {6891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6892#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:27,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {6892#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6893#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:27,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {6893#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6894#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:27,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {6894#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6895#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:27,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {6895#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6896#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:27,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {6896#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6897#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:27,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {6897#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6898#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:27,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {6898#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6899#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:27,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {6899#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {6983#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:57:27,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {6983#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {6875#false} is VALID [2022-04-28 02:57:27,614 INFO L272 TraceCheckUtils]: 28: Hoare triple {6875#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {6875#false} is VALID [2022-04-28 02:57:27,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {6875#false} ~cond := #in~cond; {6875#false} is VALID [2022-04-28 02:57:27,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {6875#false} assume 0 == ~cond; {6875#false} is VALID [2022-04-28 02:57:27,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {6875#false} assume !false; {6875#false} is VALID [2022-04-28 02:57:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:27,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:28,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {6875#false} assume !false; {6875#false} is VALID [2022-04-28 02:57:28,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {6875#false} assume 0 == ~cond; {6875#false} is VALID [2022-04-28 02:57:28,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {6875#false} ~cond := #in~cond; {6875#false} is VALID [2022-04-28 02:57:28,425 INFO L272 TraceCheckUtils]: 28: Hoare triple {6875#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {6875#false} is VALID [2022-04-28 02:57:28,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {7011#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {6875#false} is VALID [2022-04-28 02:57:28,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {7015#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7011#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:28,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {7019#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7015#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {7023#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7019#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {7027#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7023#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {7031#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7027#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {7035#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7031#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {7039#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7035#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {7043#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7039#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {7047#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7043#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {7051#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7047#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {7055#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7051#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {7059#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7055#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {7063#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7059#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {7067#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7063#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {7071#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7067#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {7075#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7071#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {7079#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7075#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {7083#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7079#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {7087#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7083#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {7091#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7087#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {7095#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7091#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {6874#true} ~x~0 := 1;~y~0 := 0; {7095#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:57:28,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {6874#true} call #t~ret5 := main(); {6874#true} is VALID [2022-04-28 02:57:28,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6874#true} {6874#true} #34#return; {6874#true} is VALID [2022-04-28 02:57:28,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {6874#true} assume true; {6874#true} is VALID [2022-04-28 02:57:28,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {6874#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(12, 2);call #Ultimate.allocInit(12, 3); {6874#true} is VALID [2022-04-28 02:57:28,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {6874#true} call ULTIMATE.init(); {6874#true} is VALID [2022-04-28 02:57:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:28,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586753204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:28,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:28,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 02:57:28,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:28,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [762140323] [2022-04-28 02:57:28,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [762140323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:28,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:28,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 02:57:28,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063114804] [2022-04-28 02:57:28,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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 32 [2022-04-28 02:57:28,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:28,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-28 02:57:28,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:28,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 02:57:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 02:57:28,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=1635, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 02:57:28,477 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-28 02:57:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:29,599 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 02:57:29,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 02:57:29,599 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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 32 [2022-04-28 02:57:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-28 02:57:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-28 02:57:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-28 02:57:29,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-28 02:57:29,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2022-04-28 02:57:29,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:29,636 INFO L225 Difference]: With dead ends: 39 [2022-04-28 02:57:29,636 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 02:57:29,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1235, Invalid=3595, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 02:57:29,638 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:29,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 02:57:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 02:57:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 02:57:29,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:29,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:29,664 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:29,664 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:29,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:29,665 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 02:57:29,665 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 02:57:29,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:29,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:29,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 02:57:29,665 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 02:57:29,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:29,666 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 02:57:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 02:57:29,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:29,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:29,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:29,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-28 02:57:29,667 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-28 02:57:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:29,667 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-28 02:57:29,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-28 02:57:29,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-28 02:57:29,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 02:57:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 02:57:29,699 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:29,699 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:29,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:29,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-28 02:57:29,899 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:29,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:29,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 43 times [2022-04-28 02:57:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:29,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [474789345] [2022-04-28 02:57:33,111 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:33,112 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash -626095561, now seen corresponding path program 1 times [2022-04-28 02:57:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:33,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677405325] [2022-04-28 02:57:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:33,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:33,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:57:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:33,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:57:33,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 44 times [2022-04-28 02:57:33,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:33,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175317682] [2022-04-28 02:57:33,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:33,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:33,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:33,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {7402#(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(12, 2);call #Ultimate.allocInit(12, 3); {7374#true} is VALID [2022-04-28 02:57:33,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-28 02:57:33,503 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7374#true} {7374#true} #34#return; {7374#true} is VALID [2022-04-28 02:57:33,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {7374#true} call ULTIMATE.init(); {7402#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:33,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {7402#(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(12, 2);call #Ultimate.allocInit(12, 3); {7374#true} is VALID [2022-04-28 02:57:33,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-28 02:57:33,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7374#true} {7374#true} #34#return; {7374#true} is VALID [2022-04-28 02:57:33,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {7374#true} call #t~ret5 := main(); {7374#true} is VALID [2022-04-28 02:57:33,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {7374#true} ~x~0 := 1;~y~0 := 0; {7379#(= main_~y~0 0)} is VALID [2022-04-28 02:57:33,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {7379#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7380#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:33,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {7380#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7381#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:33,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {7381#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7382#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:33,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {7382#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:33,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {7383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7384#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:33,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {7384#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7385#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:33,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {7385#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7386#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:33,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {7386#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7387#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:33,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {7387#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7388#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:33,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {7388#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7389#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:33,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {7389#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7390#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:33,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {7390#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7391#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:33,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {7391#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7392#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:33,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {7392#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7393#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:33,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {7393#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7394#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:33,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {7394#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7395#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:33,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {7395#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7396#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:33,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {7396#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7397#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:33,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7398#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:33,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {7398#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7399#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:33,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {7399#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7400#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:57:33,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {7400#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7401#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 22))} is VALID [2022-04-28 02:57:33,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {7401#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 22))} assume !(~y~0 % 4294967296 < 1024); {7375#false} is VALID [2022-04-28 02:57:33,515 INFO L272 TraceCheckUtils]: 29: Hoare triple {7375#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {7375#false} is VALID [2022-04-28 02:57:33,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {7375#false} ~cond := #in~cond; {7375#false} is VALID [2022-04-28 02:57:33,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {7375#false} assume 0 == ~cond; {7375#false} is VALID [2022-04-28 02:57:33,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {7375#false} assume !false; {7375#false} is VALID [2022-04-28 02:57:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:33,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:33,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175317682] [2022-04-28 02:57:33,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175317682] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:33,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016470830] [2022-04-28 02:57:33,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:57:33,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:33,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:33,517 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:33,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 02:57:33,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:57:33,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:33,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 02:57:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:33,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:33,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {7374#true} call ULTIMATE.init(); {7374#true} is VALID [2022-04-28 02:57:33,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {7374#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(12, 2);call #Ultimate.allocInit(12, 3); {7374#true} is VALID [2022-04-28 02:57:33,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-28 02:57:33,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7374#true} {7374#true} #34#return; {7374#true} is VALID [2022-04-28 02:57:33,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {7374#true} call #t~ret5 := main(); {7374#true} is VALID [2022-04-28 02:57:33,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {7374#true} ~x~0 := 1;~y~0 := 0; {7379#(= main_~y~0 0)} is VALID [2022-04-28 02:57:33,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {7379#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7380#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:33,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {7380#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7381#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:33,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {7381#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7382#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:33,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {7382#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:33,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {7383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7384#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:33,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {7384#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7385#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:33,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {7385#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7386#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:33,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {7386#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7387#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:33,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {7387#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7388#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:33,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {7388#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7389#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:33,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {7389#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7390#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:33,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {7390#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7391#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:33,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {7391#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7392#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:33,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {7392#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7393#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:33,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {7393#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7394#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:33,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {7394#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7395#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:33,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {7395#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7396#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:33,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {7396#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7397#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:33,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7398#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:33,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {7398#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7399#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:33,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {7399#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7400#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:57:33,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {7400#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7487#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:57:33,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {7487#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {7375#false} is VALID [2022-04-28 02:57:33,863 INFO L272 TraceCheckUtils]: 29: Hoare triple {7375#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {7375#false} is VALID [2022-04-28 02:57:33,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {7375#false} ~cond := #in~cond; {7375#false} is VALID [2022-04-28 02:57:33,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {7375#false} assume 0 == ~cond; {7375#false} is VALID [2022-04-28 02:57:33,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {7375#false} assume !false; {7375#false} is VALID [2022-04-28 02:57:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:33,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:34,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {7375#false} assume !false; {7375#false} is VALID [2022-04-28 02:57:34,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {7375#false} assume 0 == ~cond; {7375#false} is VALID [2022-04-28 02:57:34,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {7375#false} ~cond := #in~cond; {7375#false} is VALID [2022-04-28 02:57:34,728 INFO L272 TraceCheckUtils]: 29: Hoare triple {7375#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {7375#false} is VALID [2022-04-28 02:57:34,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {7515#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {7375#false} is VALID [2022-04-28 02:57:34,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {7519#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7515#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:34,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {7523#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7519#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {7527#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7523#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {7531#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7527#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {7535#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7531#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {7539#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7535#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {7543#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7539#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {7547#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7543#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {7551#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7547#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {7555#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7551#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {7559#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7555#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {7563#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7559#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {7567#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7563#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {7571#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7567#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {7575#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7571#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {7579#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7575#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {7583#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7579#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {7587#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7583#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {7591#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7587#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {7595#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7591#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {7599#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7595#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {7603#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7599#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {7374#true} ~x~0 := 1;~y~0 := 0; {7603#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:57:34,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {7374#true} call #t~ret5 := main(); {7374#true} is VALID [2022-04-28 02:57:34,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7374#true} {7374#true} #34#return; {7374#true} is VALID [2022-04-28 02:57:34,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-28 02:57:34,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {7374#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(12, 2);call #Ultimate.allocInit(12, 3); {7374#true} is VALID [2022-04-28 02:57:34,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {7374#true} call ULTIMATE.init(); {7374#true} is VALID [2022-04-28 02:57:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:34,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016470830] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:34,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:34,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 02:57:34,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:34,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [474789345] [2022-04-28 02:57:34,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [474789345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:34,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:34,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 02:57:34,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509358374] [2022-04-28 02:57:34,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:34,747 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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 33 [2022-04-28 02:57:34,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:34,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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-28 02:57:34,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:34,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 02:57:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 02:57:34,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 02:57:34,773 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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-28 02:57:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:35,995 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 02:57:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 02:57:35,995 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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 33 [2022-04-28 02:57:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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-28 02:57:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-28 02:57:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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-28 02:57:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-28 02:57:35,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-28 02:57:36,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:36,021 INFO L225 Difference]: With dead ends: 40 [2022-04-28 02:57:36,021 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 02:57:36,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1337, Invalid=3919, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 02:57:36,023 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:36,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 02:57:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 02:57:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 02:57:36,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:36,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-28 02:57:36,050 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-28 02:57:36,052 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-28 02:57:36,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:36,052 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 02:57:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 02:57:36,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:36,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:36,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 35 states. [2022-04-28 02:57:36,053 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 35 states. [2022-04-28 02:57:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:36,053 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 02:57:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 02:57:36,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:36,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:36,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:36,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-28 02:57:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-28 02:57:36,054 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-28 02:57:36,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:36,054 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-28 02:57:36,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 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-28 02:57:36,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-28 02:57:36,083 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-28 02:57:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 02:57:36,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 02:57:36,083 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:36,083 INFO L195 NwaCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:36,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:36,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:36,284 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:36,284 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 45 times [2022-04-28 02:57:36,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:36,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2102088885] [2022-04-28 02:57:37,132 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:37,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:37,277 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -566990217, now seen corresponding path program 1 times [2022-04-28 02:57:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:37,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412345373] [2022-04-28 02:57:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:37,283 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:57:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:37,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:57:37,287 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 46 times [2022-04-28 02:57:37,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:37,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142271976] [2022-04-28 02:57:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:37,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:37,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:37,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {7919#(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(12, 2);call #Ultimate.allocInit(12, 3); {7890#true} is VALID [2022-04-28 02:57:37,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {7890#true} assume true; {7890#true} is VALID [2022-04-28 02:57:37,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7890#true} {7890#true} #34#return; {7890#true} is VALID [2022-04-28 02:57:37,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {7890#true} call ULTIMATE.init(); {7919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:37,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {7919#(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(12, 2);call #Ultimate.allocInit(12, 3); {7890#true} is VALID [2022-04-28 02:57:37,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {7890#true} assume true; {7890#true} is VALID [2022-04-28 02:57:37,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7890#true} {7890#true} #34#return; {7890#true} is VALID [2022-04-28 02:57:37,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {7890#true} call #t~ret5 := main(); {7890#true} is VALID [2022-04-28 02:57:37,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {7890#true} ~x~0 := 1;~y~0 := 0; {7895#(= main_~y~0 0)} is VALID [2022-04-28 02:57:37,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {7895#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7896#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:37,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {7896#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7897#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:37,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {7897#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7898#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:37,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {7898#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7899#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:37,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {7899#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7900#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:37,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {7900#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7901#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:37,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {7901#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7902#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:37,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {7902#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7903#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:37,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {7903#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7904#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:37,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {7904#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7905#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:37,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {7905#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7906#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:37,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {7906#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7907#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:37,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {7907#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7908#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:37,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {7908#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7909#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:37,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {7909#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7910#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:37,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {7910#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7911#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:37,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {7911#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7912#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:37,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {7912#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7913#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:37,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {7913#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7914#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:37,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {7914#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7915#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:37,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {7915#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7916#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:57:37,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {7916#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7917#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:57:37,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {7917#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7918#(and (<= main_~y~0 23) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:57:37,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {7918#(and (<= main_~y~0 23) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {7891#false} is VALID [2022-04-28 02:57:37,695 INFO L272 TraceCheckUtils]: 30: Hoare triple {7891#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {7891#false} is VALID [2022-04-28 02:57:37,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {7891#false} ~cond := #in~cond; {7891#false} is VALID [2022-04-28 02:57:37,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {7891#false} assume 0 == ~cond; {7891#false} is VALID [2022-04-28 02:57:37,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {7891#false} assume !false; {7891#false} is VALID [2022-04-28 02:57:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:37,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:37,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142271976] [2022-04-28 02:57:37,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142271976] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:37,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851710927] [2022-04-28 02:57:37,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:57:37,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:37,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:37,701 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:37,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 02:57:37,764 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:57:37,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:37,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 02:57:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:37,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:38,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {7890#true} call ULTIMATE.init(); {7890#true} is VALID [2022-04-28 02:57:38,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {7890#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(12, 2);call #Ultimate.allocInit(12, 3); {7890#true} is VALID [2022-04-28 02:57:38,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {7890#true} assume true; {7890#true} is VALID [2022-04-28 02:57:38,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7890#true} {7890#true} #34#return; {7890#true} is VALID [2022-04-28 02:57:38,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {7890#true} call #t~ret5 := main(); {7890#true} is VALID [2022-04-28 02:57:38,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {7890#true} ~x~0 := 1;~y~0 := 0; {7895#(= main_~y~0 0)} is VALID [2022-04-28 02:57:38,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {7895#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7896#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:38,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {7896#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7897#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:38,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {7897#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7898#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:38,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {7898#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7899#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:38,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {7899#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7900#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:38,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {7900#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7901#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:38,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {7901#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7902#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:38,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {7902#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7903#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:38,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {7903#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7904#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:38,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {7904#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7905#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:38,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {7905#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7906#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:38,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {7906#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7907#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:38,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {7907#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7908#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:38,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {7908#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7909#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:38,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {7909#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7910#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:38,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {7910#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7911#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:38,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {7911#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7912#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:38,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {7912#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7913#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:38,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {7913#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7914#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:38,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {7914#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7915#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:38,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {7915#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7916#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:57:38,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {7916#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {7917#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:57:38,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {7917#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8007#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:57:38,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {8007#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {7891#false} is VALID [2022-04-28 02:57:38,107 INFO L272 TraceCheckUtils]: 30: Hoare triple {7891#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {7891#false} is VALID [2022-04-28 02:57:38,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {7891#false} ~cond := #in~cond; {7891#false} is VALID [2022-04-28 02:57:38,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {7891#false} assume 0 == ~cond; {7891#false} is VALID [2022-04-28 02:57:38,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {7891#false} assume !false; {7891#false} is VALID [2022-04-28 02:57:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:38,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:39,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {7891#false} assume !false; {7891#false} is VALID [2022-04-28 02:57:39,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {7891#false} assume 0 == ~cond; {7891#false} is VALID [2022-04-28 02:57:39,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {7891#false} ~cond := #in~cond; {7891#false} is VALID [2022-04-28 02:57:39,062 INFO L272 TraceCheckUtils]: 30: Hoare triple {7891#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {7891#false} is VALID [2022-04-28 02:57:39,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {8035#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {7891#false} is VALID [2022-04-28 02:57:39,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {8039#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8035#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:39,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {8043#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8039#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {8047#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8043#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {8051#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8047#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {8055#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8051#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {8059#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8055#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {8063#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8059#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {8067#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8063#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {8071#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8067#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {8075#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8071#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {8079#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8075#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {8083#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8079#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {8087#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8083#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {8091#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8087#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {8095#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8091#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {8099#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8095#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {8103#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8099#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {8107#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8103#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {8111#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8107#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {8115#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8111#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {8119#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8115#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {8123#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8119#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {8127#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8123#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {7890#true} ~x~0 := 1;~y~0 := 0; {8127#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:39,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {7890#true} call #t~ret5 := main(); {7890#true} is VALID [2022-04-28 02:57:39,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7890#true} {7890#true} #34#return; {7890#true} is VALID [2022-04-28 02:57:39,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {7890#true} assume true; {7890#true} is VALID [2022-04-28 02:57:39,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {7890#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(12, 2);call #Ultimate.allocInit(12, 3); {7890#true} is VALID [2022-04-28 02:57:39,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {7890#true} call ULTIMATE.init(); {7890#true} is VALID [2022-04-28 02:57:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:39,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851710927] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:39,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:39,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 02:57:39,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:39,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2102088885] [2022-04-28 02:57:39,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2102088885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:39,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:39,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 02:57:39,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153321252] [2022-04-28 02:57:39,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:39,079 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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 34 [2022-04-28 02:57:39,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:39,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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-28 02:57:39,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:39,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 02:57:39,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:39,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 02:57:39,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 02:57:39,098 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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-28 02:57:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:40,386 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 02:57:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 02:57:40,386 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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 34 [2022-04-28 02:57:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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-28 02:57:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-28 02:57:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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-28 02:57:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-28 02:57:40,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 41 transitions. [2022-04-28 02:57:40,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:40,422 INFO L225 Difference]: With dead ends: 41 [2022-04-28 02:57:40,422 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 02:57:40,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1443, Invalid=4257, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 02:57:40,423 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:40,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 02:57:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 02:57:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 02:57:40,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:40,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 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-28 02:57:40,460 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 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-28 02:57:40,460 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 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-28 02:57:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:40,461 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 02:57:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 02:57:40,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:40,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:40,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 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 36 states. [2022-04-28 02:57:40,461 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 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 36 states. [2022-04-28 02:57:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:40,462 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 02:57:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 02:57:40,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:40,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:40,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:40,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 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-28 02:57:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-28 02:57:40,463 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-28 02:57:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:40,463 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-28 02:57:40,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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-28 02:57:40,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-28 02:57:40,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 02:57:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 02:57:40,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:40,494 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:40,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:40,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:40,707 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:40,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 47 times [2022-04-28 02:57:40,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:40,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [723805599] [2022-04-28 02:57:42,085 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:42,218 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:42,219 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:42,220 INFO L85 PathProgramCache]: Analyzing trace with hash -507884873, now seen corresponding path program 1 times [2022-04-28 02:57:42,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:42,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447331232] [2022-04-28 02:57:42,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:42,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:42,237 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:57:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:42,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:57:42,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 48 times [2022-04-28 02:57:42,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:42,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006900003] [2022-04-28 02:57:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:42,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:42,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:42,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {8452#(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(12, 2);call #Ultimate.allocInit(12, 3); {8422#true} is VALID [2022-04-28 02:57:42,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {8422#true} assume true; {8422#true} is VALID [2022-04-28 02:57:42,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8422#true} {8422#true} #34#return; {8422#true} is VALID [2022-04-28 02:57:42,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {8422#true} call ULTIMATE.init(); {8452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:42,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {8452#(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(12, 2);call #Ultimate.allocInit(12, 3); {8422#true} is VALID [2022-04-28 02:57:42,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {8422#true} assume true; {8422#true} is VALID [2022-04-28 02:57:42,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8422#true} {8422#true} #34#return; {8422#true} is VALID [2022-04-28 02:57:42,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {8422#true} call #t~ret5 := main(); {8422#true} is VALID [2022-04-28 02:57:42,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {8422#true} ~x~0 := 1;~y~0 := 0; {8427#(= main_~y~0 0)} is VALID [2022-04-28 02:57:42,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {8427#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:42,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {8428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:42,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {8429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:42,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {8430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:42,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {8431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:42,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {8432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:42,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {8433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:42,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {8434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:42,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {8435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:42,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {8436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:42,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {8437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8438#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:42,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {8438#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8439#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:42,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {8439#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:42,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {8440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8441#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:42,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {8441#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8442#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:42,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {8442#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8443#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:42,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {8443#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8444#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:42,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {8444#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8445#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:42,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {8445#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8446#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:42,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {8446#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8447#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:42,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {8447#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8448#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:57:42,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {8448#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8449#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:57:42,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {8449#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8450#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:57:42,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {8450#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8451#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 24))} is VALID [2022-04-28 02:57:42,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {8451#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 24))} assume !(~y~0 % 4294967296 < 1024); {8423#false} is VALID [2022-04-28 02:57:42,672 INFO L272 TraceCheckUtils]: 31: Hoare triple {8423#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {8423#false} is VALID [2022-04-28 02:57:42,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {8423#false} ~cond := #in~cond; {8423#false} is VALID [2022-04-28 02:57:42,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {8423#false} assume 0 == ~cond; {8423#false} is VALID [2022-04-28 02:57:42,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {8423#false} assume !false; {8423#false} is VALID [2022-04-28 02:57:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:42,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:42,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006900003] [2022-04-28 02:57:42,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006900003] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:42,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473645001] [2022-04-28 02:57:42,673 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:57:42,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:42,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:42,674 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:42,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 02:57:43,036 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 02:57:43,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:43,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 02:57:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:43,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:43,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {8422#true} call ULTIMATE.init(); {8422#true} is VALID [2022-04-28 02:57:43,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {8422#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(12, 2);call #Ultimate.allocInit(12, 3); {8422#true} is VALID [2022-04-28 02:57:43,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {8422#true} assume true; {8422#true} is VALID [2022-04-28 02:57:43,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8422#true} {8422#true} #34#return; {8422#true} is VALID [2022-04-28 02:57:43,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {8422#true} call #t~ret5 := main(); {8422#true} is VALID [2022-04-28 02:57:43,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {8422#true} ~x~0 := 1;~y~0 := 0; {8427#(= main_~y~0 0)} is VALID [2022-04-28 02:57:43,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {8427#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:43,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {8428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:43,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {8429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:43,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {8430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:43,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {8431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:43,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {8432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:43,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {8433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:43,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {8434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:43,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {8435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:43,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {8436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:43,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {8437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8438#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:43,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {8438#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8439#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:43,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {8439#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:43,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {8440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8441#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:43,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {8441#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8442#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:43,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {8442#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8443#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:43,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {8443#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8444#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:43,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {8444#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8445#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:43,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {8445#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8446#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:43,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {8446#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8447#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:43,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {8447#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8448#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:57:43,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {8448#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8449#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:57:43,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {8449#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8450#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:57:43,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {8450#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8543#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:57:43,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {8543#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~y~0 % 4294967296 < 1024); {8423#false} is VALID [2022-04-28 02:57:43,362 INFO L272 TraceCheckUtils]: 31: Hoare triple {8423#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {8423#false} is VALID [2022-04-28 02:57:43,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {8423#false} ~cond := #in~cond; {8423#false} is VALID [2022-04-28 02:57:43,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {8423#false} assume 0 == ~cond; {8423#false} is VALID [2022-04-28 02:57:43,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {8423#false} assume !false; {8423#false} is VALID [2022-04-28 02:57:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:43,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:44,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {8423#false} assume !false; {8423#false} is VALID [2022-04-28 02:57:44,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {8423#false} assume 0 == ~cond; {8423#false} is VALID [2022-04-28 02:57:44,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {8423#false} ~cond := #in~cond; {8423#false} is VALID [2022-04-28 02:57:44,373 INFO L272 TraceCheckUtils]: 31: Hoare triple {8423#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {8423#false} is VALID [2022-04-28 02:57:44,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {8571#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {8423#false} is VALID [2022-04-28 02:57:44,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {8575#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8571#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:44,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {8579#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8575#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {8583#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8579#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {8587#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8583#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {8591#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8587#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {8595#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8591#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {8599#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8595#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {8603#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8599#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {8607#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8603#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {8611#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8607#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {8615#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8611#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {8619#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8615#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {8623#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8619#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {8627#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8623#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {8631#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8627#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {8635#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8631#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {8639#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8635#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {8643#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8639#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {8647#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8643#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {8651#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8647#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {8655#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8651#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {8659#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8655#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {8663#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8659#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {8667#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8663#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {8422#true} ~x~0 := 1;~y~0 := 0; {8667#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:57:44,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {8422#true} call #t~ret5 := main(); {8422#true} is VALID [2022-04-28 02:57:44,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8422#true} {8422#true} #34#return; {8422#true} is VALID [2022-04-28 02:57:44,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {8422#true} assume true; {8422#true} is VALID [2022-04-28 02:57:44,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {8422#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(12, 2);call #Ultimate.allocInit(12, 3); {8422#true} is VALID [2022-04-28 02:57:44,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {8422#true} call ULTIMATE.init(); {8422#true} is VALID [2022-04-28 02:57:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:44,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473645001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:44,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:44,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-28 02:57:44,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:44,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [723805599] [2022-04-28 02:57:44,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [723805599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:44,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:44,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 02:57:44,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208949815] [2022-04-28 02:57:44,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:44,405 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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 35 [2022-04-28 02:57:44,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:44,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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-28 02:57:44,426 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-28 02:57:44,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 02:57:44,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:44,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 02:57:44,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=2082, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 02:57:44,427 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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-28 02:57:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:45,654 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 02:57:45,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 02:57:45,654 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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 35 [2022-04-28 02:57:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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-28 02:57:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-28 02:57:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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-28 02:57:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-28 02:57:45,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-28 02:57:45,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:45,688 INFO L225 Difference]: With dead ends: 42 [2022-04-28 02:57:45,688 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 02:57:45,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1553, Invalid=4609, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 02:57:45,689 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:45,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 02:57:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 02:57:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 02:57:45,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:45,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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-28 02:57:45,719 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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-28 02:57:45,719 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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-28 02:57:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:45,720 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 02:57:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 02:57:45,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:45,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:45,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 37 states. [2022-04-28 02:57:45,720 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 37 states. [2022-04-28 02:57:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:45,720 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 02:57:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 02:57:45,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:45,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:45,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:45,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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-28 02:57:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-28 02:57:45,721 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-28 02:57:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:45,721 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-28 02:57:45,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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-28 02:57:45,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-28 02:57:45,757 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-28 02:57:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 02:57:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 02:57:45,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:45,757 INFO L195 NwaCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:45,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:45,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2022-04-28 02:57:45,958 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:45,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 49 times [2022-04-28 02:57:45,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:45,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99330789] [2022-04-28 02:57:50,620 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:50,749 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:50,750 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:50,752 INFO L85 PathProgramCache]: Analyzing trace with hash -448779529, now seen corresponding path program 1 times [2022-04-28 02:57:50,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:50,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140666661] [2022-04-28 02:57:50,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:50,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:50,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:57:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:50,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:57:50,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 50 times [2022-04-28 02:57:50,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:50,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397435527] [2022-04-28 02:57:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:51,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:51,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {9001#(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(12, 2);call #Ultimate.allocInit(12, 3); {8970#true} is VALID [2022-04-28 02:57:51,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {8970#true} assume true; {8970#true} is VALID [2022-04-28 02:57:51,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8970#true} {8970#true} #34#return; {8970#true} is VALID [2022-04-28 02:57:51,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {8970#true} call ULTIMATE.init(); {9001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:51,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {9001#(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(12, 2);call #Ultimate.allocInit(12, 3); {8970#true} is VALID [2022-04-28 02:57:51,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {8970#true} assume true; {8970#true} is VALID [2022-04-28 02:57:51,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8970#true} {8970#true} #34#return; {8970#true} is VALID [2022-04-28 02:57:51,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {8970#true} call #t~ret5 := main(); {8970#true} is VALID [2022-04-28 02:57:51,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {8970#true} ~x~0 := 1;~y~0 := 0; {8975#(= main_~y~0 0)} is VALID [2022-04-28 02:57:51,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {8975#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8976#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:51,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {8976#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8977#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:51,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {8977#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8978#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:51,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {8978#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8979#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:51,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {8979#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8980#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:51,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {8980#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8981#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:51,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {8981#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8982#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:51,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {8982#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8983#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:51,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {8983#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8984#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:51,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {8984#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8985#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:51,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {8985#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8986#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:51,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {8986#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8987#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:51,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {8987#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8988#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:51,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {8988#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8989#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:51,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {8989#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8990#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:51,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {8990#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8991#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:51,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {8991#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8992#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:51,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {8992#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8993#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:51,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {8993#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8994#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:51,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {8994#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8995#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:51,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {8995#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8996#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:57:51,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {8996#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8997#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:57:51,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {8997#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8998#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:57:51,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {8998#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8999#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:57:51,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {8999#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9000#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 25))} is VALID [2022-04-28 02:57:51,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {9000#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 25))} assume !(~y~0 % 4294967296 < 1024); {8971#false} is VALID [2022-04-28 02:57:51,243 INFO L272 TraceCheckUtils]: 32: Hoare triple {8971#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {8971#false} is VALID [2022-04-28 02:57:51,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {8971#false} ~cond := #in~cond; {8971#false} is VALID [2022-04-28 02:57:51,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {8971#false} assume 0 == ~cond; {8971#false} is VALID [2022-04-28 02:57:51,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {8971#false} assume !false; {8971#false} is VALID [2022-04-28 02:57:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:51,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:51,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397435527] [2022-04-28 02:57:51,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397435527] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:51,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982645068] [2022-04-28 02:57:51,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:57:51,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:51,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:51,245 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:51,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 02:57:51,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:57:51,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:51,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 02:57:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:51,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:51,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {8970#true} call ULTIMATE.init(); {8970#true} is VALID [2022-04-28 02:57:51,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {8970#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(12, 2);call #Ultimate.allocInit(12, 3); {8970#true} is VALID [2022-04-28 02:57:51,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {8970#true} assume true; {8970#true} is VALID [2022-04-28 02:57:51,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8970#true} {8970#true} #34#return; {8970#true} is VALID [2022-04-28 02:57:51,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {8970#true} call #t~ret5 := main(); {8970#true} is VALID [2022-04-28 02:57:51,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {8970#true} ~x~0 := 1;~y~0 := 0; {8975#(= main_~y~0 0)} is VALID [2022-04-28 02:57:51,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {8975#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8976#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:51,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {8976#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8977#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:51,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {8977#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8978#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:51,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {8978#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8979#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:51,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {8979#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8980#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:51,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {8980#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8981#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:51,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {8981#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8982#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:51,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {8982#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8983#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:51,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {8983#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8984#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:51,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {8984#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8985#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:51,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {8985#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8986#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:51,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {8986#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8987#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:51,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {8987#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8988#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:51,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {8988#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8989#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:51,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {8989#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8990#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:51,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {8990#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8991#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:51,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {8991#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8992#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:51,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {8992#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8993#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:51,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {8993#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8994#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:51,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {8994#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8995#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:51,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {8995#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8996#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:57:51,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {8996#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8997#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:57:51,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {8997#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8998#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:57:51,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {8998#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {8999#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:57:51,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {8999#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9095#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:57:51,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {9095#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~y~0 % 4294967296 < 1024); {8971#false} is VALID [2022-04-28 02:57:51,638 INFO L272 TraceCheckUtils]: 32: Hoare triple {8971#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {8971#false} is VALID [2022-04-28 02:57:51,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {8971#false} ~cond := #in~cond; {8971#false} is VALID [2022-04-28 02:57:51,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {8971#false} assume 0 == ~cond; {8971#false} is VALID [2022-04-28 02:57:51,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {8971#false} assume !false; {8971#false} is VALID [2022-04-28 02:57:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:51,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:52,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {8971#false} assume !false; {8971#false} is VALID [2022-04-28 02:57:52,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {8971#false} assume 0 == ~cond; {8971#false} is VALID [2022-04-28 02:57:52,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {8971#false} ~cond := #in~cond; {8971#false} is VALID [2022-04-28 02:57:52,698 INFO L272 TraceCheckUtils]: 32: Hoare triple {8971#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {8971#false} is VALID [2022-04-28 02:57:52,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {9123#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {8971#false} is VALID [2022-04-28 02:57:52,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {9127#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9123#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:52,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {9131#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9127#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {9135#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9131#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {9139#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9135#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {9143#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9139#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {9147#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9143#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {9151#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9147#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {9155#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9151#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {9159#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9155#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {9163#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9159#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {9167#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9163#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {9171#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9167#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {9175#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9171#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {9179#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9175#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {9183#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9179#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {9187#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9183#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {9191#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9187#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {9195#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9191#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {9199#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9195#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {9203#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9199#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {9207#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9203#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {9211#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9207#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {9215#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9211#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {9219#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9215#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {9223#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9219#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {8970#true} ~x~0 := 1;~y~0 := 0; {9223#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:57:52,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {8970#true} call #t~ret5 := main(); {8970#true} is VALID [2022-04-28 02:57:52,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8970#true} {8970#true} #34#return; {8970#true} is VALID [2022-04-28 02:57:52,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {8970#true} assume true; {8970#true} is VALID [2022-04-28 02:57:52,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {8970#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(12, 2);call #Ultimate.allocInit(12, 3); {8970#true} is VALID [2022-04-28 02:57:52,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {8970#true} call ULTIMATE.init(); {8970#true} is VALID [2022-04-28 02:57:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:52,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982645068] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:52,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:52,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-28 02:57:52,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:52,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99330789] [2022-04-28 02:57:52,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99330789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:52,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:52,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 02:57:52,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448299598] [2022-04-28 02:57:52,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:52,718 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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 36 [2022-04-28 02:57:52,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:52,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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-28 02:57:52,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:52,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 02:57:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:52,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 02:57:52,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=837, Invalid=2243, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 02:57:52,737 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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-28 02:57:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:54,249 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 02:57:54,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 02:57:54,249 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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 36 [2022-04-28 02:57:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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-28 02:57:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-28 02:57:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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-28 02:57:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-28 02:57:54,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 43 transitions. [2022-04-28 02:57:54,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:54,280 INFO L225 Difference]: With dead ends: 43 [2022-04-28 02:57:54,280 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 02:57:54,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1667, Invalid=4975, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 02:57:54,281 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:54,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 143 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 02:57:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 02:57:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 02:57:54,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:54,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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-28 02:57:54,316 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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-28 02:57:54,316 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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-28 02:57:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:54,317 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 02:57:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 02:57:54,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:54,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:54,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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 38 states. [2022-04-28 02:57:54,317 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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 38 states. [2022-04-28 02:57:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:54,318 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 02:57:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 02:57:54,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:54,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:54,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:54,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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-28 02:57:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-28 02:57:54,318 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-28 02:57:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:54,319 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-28 02:57:54,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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-28 02:57:54,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-28 02:57:54,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 02:57:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 02:57:54,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:54,350 INFO L195 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:54,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 02:57:54,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-28 02:57:54,550 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:54,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:54,550 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 51 times [2022-04-28 02:57:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:54,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [300419255] [2022-04-28 02:57:57,436 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:57,552 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:57,553 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:57,555 INFO L85 PathProgramCache]: Analyzing trace with hash -389674185, now seen corresponding path program 1 times [2022-04-28 02:57:57,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:57,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802473086] [2022-04-28 02:57:57,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:57,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:57,560 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:57:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:57:57,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:57:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 52 times [2022-04-28 02:57:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:57,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28021076] [2022-04-28 02:57:57,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:57,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:58,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:58,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {9566#(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(12, 2);call #Ultimate.allocInit(12, 3); {9534#true} is VALID [2022-04-28 02:57:58,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {9534#true} assume true; {9534#true} is VALID [2022-04-28 02:57:58,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9534#true} {9534#true} #34#return; {9534#true} is VALID [2022-04-28 02:57:58,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {9534#true} call ULTIMATE.init(); {9566#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:58,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {9566#(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(12, 2);call #Ultimate.allocInit(12, 3); {9534#true} is VALID [2022-04-28 02:57:58,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {9534#true} assume true; {9534#true} is VALID [2022-04-28 02:57:58,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9534#true} {9534#true} #34#return; {9534#true} is VALID [2022-04-28 02:57:58,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {9534#true} call #t~ret5 := main(); {9534#true} is VALID [2022-04-28 02:57:58,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {9534#true} ~x~0 := 1;~y~0 := 0; {9539#(= main_~y~0 0)} is VALID [2022-04-28 02:57:58,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {9539#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9540#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:58,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {9540#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9541#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:58,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {9541#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9542#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:58,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {9542#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9543#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:58,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {9543#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9544#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:58,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {9544#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9545#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:58,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {9545#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9546#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:58,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {9546#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9547#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:58,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {9547#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9548#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:58,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {9548#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9549#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:58,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {9549#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9550#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:58,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {9550#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9551#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:58,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {9551#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9552#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:58,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {9552#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9553#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:58,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {9553#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9554#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:58,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {9554#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9555#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:58,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {9555#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9556#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:58,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {9556#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9557#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:58,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {9557#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9558#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:58,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {9558#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9559#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:58,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {9559#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9560#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:57:58,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {9560#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9561#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:57:58,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {9561#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9562#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:57:58,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {9562#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9563#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:57:58,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {9563#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9564#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:57:58,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {9564#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9565#(and (<= main_~y~0 26) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:57:58,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {9565#(and (<= main_~y~0 26) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {9535#false} is VALID [2022-04-28 02:57:58,030 INFO L272 TraceCheckUtils]: 33: Hoare triple {9535#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {9535#false} is VALID [2022-04-28 02:57:58,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {9535#false} ~cond := #in~cond; {9535#false} is VALID [2022-04-28 02:57:58,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {9535#false} assume 0 == ~cond; {9535#false} is VALID [2022-04-28 02:57:58,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {9535#false} assume !false; {9535#false} is VALID [2022-04-28 02:57:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:58,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28021076] [2022-04-28 02:57:58,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28021076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:58,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690523387] [2022-04-28 02:57:58,031 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:57:58,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:58,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:58,032 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:58,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 02:57:58,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:57:58,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:58,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 02:57:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:58,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:58,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {9534#true} call ULTIMATE.init(); {9534#true} is VALID [2022-04-28 02:57:58,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {9534#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(12, 2);call #Ultimate.allocInit(12, 3); {9534#true} is VALID [2022-04-28 02:57:58,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {9534#true} assume true; {9534#true} is VALID [2022-04-28 02:57:58,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9534#true} {9534#true} #34#return; {9534#true} is VALID [2022-04-28 02:57:58,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {9534#true} call #t~ret5 := main(); {9534#true} is VALID [2022-04-28 02:57:58,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {9534#true} ~x~0 := 1;~y~0 := 0; {9539#(= main_~y~0 0)} is VALID [2022-04-28 02:57:58,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {9539#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9540#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:57:58,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {9540#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9541#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:57:58,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {9541#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9542#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:57:58,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {9542#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9543#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:57:58,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {9543#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9544#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:57:58,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {9544#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9545#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:57:58,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {9545#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9546#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:57:58,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {9546#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9547#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:57:58,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {9547#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9548#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:57:58,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {9548#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9549#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:57:58,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {9549#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9550#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:57:58,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {9550#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9551#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:57:58,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {9551#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9552#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:57:58,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {9552#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9553#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:57:58,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {9553#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9554#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:57:58,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {9554#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9555#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:57:58,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {9555#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9556#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:57:58,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {9556#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9557#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:57:58,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {9557#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9558#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:57:58,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {9558#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9559#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:57:58,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {9559#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9560#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:57:58,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {9560#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9561#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:57:58,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {9561#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9562#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:57:58,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {9562#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9563#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:57:58,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {9563#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9564#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:57:58,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {9564#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9663#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:57:58,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {9663#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {9535#false} is VALID [2022-04-28 02:57:58,450 INFO L272 TraceCheckUtils]: 33: Hoare triple {9535#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {9535#false} is VALID [2022-04-28 02:57:58,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {9535#false} ~cond := #in~cond; {9535#false} is VALID [2022-04-28 02:57:58,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {9535#false} assume 0 == ~cond; {9535#false} is VALID [2022-04-28 02:57:58,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {9535#false} assume !false; {9535#false} is VALID [2022-04-28 02:57:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:58,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:59,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {9535#false} assume !false; {9535#false} is VALID [2022-04-28 02:57:59,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {9535#false} assume 0 == ~cond; {9535#false} is VALID [2022-04-28 02:57:59,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {9535#false} ~cond := #in~cond; {9535#false} is VALID [2022-04-28 02:57:59,592 INFO L272 TraceCheckUtils]: 33: Hoare triple {9535#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {9535#false} is VALID [2022-04-28 02:57:59,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {9691#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {9535#false} is VALID [2022-04-28 02:57:59,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {9695#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9691#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:57:59,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {9699#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9695#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {9703#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9699#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {9707#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9703#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {9711#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9707#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {9715#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9711#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {9719#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9715#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {9723#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9719#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {9727#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9723#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {9731#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9727#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {9735#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9731#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {9739#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9735#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {9743#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9739#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {9747#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9743#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {9751#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9747#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {9755#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9751#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {9759#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9755#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {9763#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9759#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {9767#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9763#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {9771#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9767#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {9775#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9771#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {9779#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9775#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {9783#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9779#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {9787#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9783#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {9791#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9787#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {9795#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {9791#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {9534#true} ~x~0 := 1;~y~0 := 0; {9795#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:57:59,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {9534#true} call #t~ret5 := main(); {9534#true} is VALID [2022-04-28 02:57:59,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9534#true} {9534#true} #34#return; {9534#true} is VALID [2022-04-28 02:57:59,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {9534#true} assume true; {9534#true} is VALID [2022-04-28 02:57:59,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {9534#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(12, 2);call #Ultimate.allocInit(12, 3); {9534#true} is VALID [2022-04-28 02:57:59,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {9534#true} call ULTIMATE.init(); {9534#true} is VALID [2022-04-28 02:57:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:59,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690523387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:59,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:59,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-28 02:57:59,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:59,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [300419255] [2022-04-28 02:57:59,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [300419255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:59,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:59,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 02:57:59,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713965069] [2022-04-28 02:57:59,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:59,611 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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 37 [2022-04-28 02:57:59,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:59,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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-28 02:57:59,630 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-28 02:57:59,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 02:57:59,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:59,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 02:57:59,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=896, Invalid=2410, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 02:57:59,631 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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-28 02:58:01,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:01,189 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 02:58:01,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 02:58:01,189 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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 37 [2022-04-28 02:58:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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-28 02:58:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-28 02:58:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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-28 02:58:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-28 02:58:01,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-28 02:58:01,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:01,224 INFO L225 Difference]: With dead ends: 44 [2022-04-28 02:58:01,225 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 02:58:01,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1785, Invalid=5355, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 02:58:01,225 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:01,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 02:58:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 02:58:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 02:58:01,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:01,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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-28 02:58:01,260 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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-28 02:58:01,260 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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-28 02:58:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:01,260 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 02:58:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 02:58:01,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:01,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:01,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 39 states. [2022-04-28 02:58:01,261 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 39 states. [2022-04-28 02:58:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:01,261 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 02:58:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 02:58:01,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:01,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:01,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:01,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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-28 02:58:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-28 02:58:01,262 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-28 02:58:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:01,262 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-28 02:58:01,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 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-28 02:58:01,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-28 02:58:01,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 02:58:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 02:58:01,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:01,291 INFO L195 NwaCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:01,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:01,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53 [2022-04-28 02:58:01,491 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:01,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:01,492 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 53 times [2022-04-28 02:58:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:01,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1931233924] [2022-04-28 02:58:02,620 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:58:02,753 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:02,755 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash -330568841, now seen corresponding path program 1 times [2022-04-28 02:58:02,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:02,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668759002] [2022-04-28 02:58:02,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:02,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:02,762 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:58:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:02,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:58:02,765 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 54 times [2022-04-28 02:58:02,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:02,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592483129] [2022-04-28 02:58:02,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:02,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:03,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:03,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {10147#(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(12, 2);call #Ultimate.allocInit(12, 3); {10114#true} is VALID [2022-04-28 02:58:03,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {10114#true} assume true; {10114#true} is VALID [2022-04-28 02:58:03,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10114#true} {10114#true} #34#return; {10114#true} is VALID [2022-04-28 02:58:03,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {10114#true} call ULTIMATE.init(); {10147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:03,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {10147#(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(12, 2);call #Ultimate.allocInit(12, 3); {10114#true} is VALID [2022-04-28 02:58:03,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {10114#true} assume true; {10114#true} is VALID [2022-04-28 02:58:03,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10114#true} {10114#true} #34#return; {10114#true} is VALID [2022-04-28 02:58:03,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {10114#true} call #t~ret5 := main(); {10114#true} is VALID [2022-04-28 02:58:03,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {10114#true} ~x~0 := 1;~y~0 := 0; {10119#(= main_~y~0 0)} is VALID [2022-04-28 02:58:03,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {10119#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10120#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:03,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {10120#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10121#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:03,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {10121#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10122#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:03,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {10122#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10123#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:03,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {10123#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10124#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:03,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {10124#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10125#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:03,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {10125#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10126#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:03,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {10126#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10127#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:03,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {10127#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10128#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:03,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {10128#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10129#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:03,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {10129#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10130#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:03,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {10130#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10131#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:03,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {10131#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10132#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:03,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {10132#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10133#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:03,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {10133#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10134#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:03,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {10134#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10135#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:03,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {10135#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10136#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:03,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {10136#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10137#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:03,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {10137#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10138#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:03,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {10138#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10139#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:03,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {10139#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10140#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:03,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {10140#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10141#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:03,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {10141#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10142#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:03,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {10142#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10143#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:03,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {10143#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10144#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:03,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {10144#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10145#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:03,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {10145#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10146#(and (<= main_~y~0 27) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:58:03,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {10146#(and (<= main_~y~0 27) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {10115#false} is VALID [2022-04-28 02:58:03,259 INFO L272 TraceCheckUtils]: 34: Hoare triple {10115#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {10115#false} is VALID [2022-04-28 02:58:03,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {10115#false} ~cond := #in~cond; {10115#false} is VALID [2022-04-28 02:58:03,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {10115#false} assume 0 == ~cond; {10115#false} is VALID [2022-04-28 02:58:03,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {10115#false} assume !false; {10115#false} is VALID [2022-04-28 02:58:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:03,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:03,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592483129] [2022-04-28 02:58:03,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592483129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:03,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270022855] [2022-04-28 02:58:03,260 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:58:03,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:03,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:03,261 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:03,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 02:58:03,940 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-28 02:58:03,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:03,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 02:58:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:03,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:04,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {10114#true} call ULTIMATE.init(); {10114#true} is VALID [2022-04-28 02:58:04,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {10114#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(12, 2);call #Ultimate.allocInit(12, 3); {10114#true} is VALID [2022-04-28 02:58:04,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {10114#true} assume true; {10114#true} is VALID [2022-04-28 02:58:04,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10114#true} {10114#true} #34#return; {10114#true} is VALID [2022-04-28 02:58:04,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {10114#true} call #t~ret5 := main(); {10114#true} is VALID [2022-04-28 02:58:04,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {10114#true} ~x~0 := 1;~y~0 := 0; {10119#(= main_~y~0 0)} is VALID [2022-04-28 02:58:04,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {10119#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10120#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:04,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {10120#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10121#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:04,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {10121#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10122#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:04,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {10122#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10123#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:04,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {10123#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10124#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:04,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {10124#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10125#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:04,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {10125#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10126#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:04,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {10126#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10127#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:04,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {10127#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10128#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:04,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {10128#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10129#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:04,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {10129#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10130#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:04,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {10130#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10131#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:04,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {10131#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10132#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:04,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {10132#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10133#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:04,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {10133#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10134#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:04,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {10134#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10135#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:04,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {10135#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10136#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:04,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {10136#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10137#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:04,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {10137#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10138#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:04,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {10138#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10139#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:04,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {10139#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10140#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:04,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {10140#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10141#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:04,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {10141#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10142#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:04,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {10142#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10143#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:04,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {10143#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10144#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:04,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {10144#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10145#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:04,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {10145#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10247#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:04,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {10247#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {10115#false} is VALID [2022-04-28 02:58:04,322 INFO L272 TraceCheckUtils]: 34: Hoare triple {10115#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {10115#false} is VALID [2022-04-28 02:58:04,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {10115#false} ~cond := #in~cond; {10115#false} is VALID [2022-04-28 02:58:04,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {10115#false} assume 0 == ~cond; {10115#false} is VALID [2022-04-28 02:58:04,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {10115#false} assume !false; {10115#false} is VALID [2022-04-28 02:58:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:04,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:05,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {10115#false} assume !false; {10115#false} is VALID [2022-04-28 02:58:05,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {10115#false} assume 0 == ~cond; {10115#false} is VALID [2022-04-28 02:58:05,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {10115#false} ~cond := #in~cond; {10115#false} is VALID [2022-04-28 02:58:05,580 INFO L272 TraceCheckUtils]: 34: Hoare triple {10115#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {10115#false} is VALID [2022-04-28 02:58:05,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {10275#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {10115#false} is VALID [2022-04-28 02:58:05,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {10279#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10275#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:58:05,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {10283#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10279#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {10287#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10283#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {10291#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10287#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {10295#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10291#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {10299#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10295#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {10303#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10299#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {10307#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10303#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {10311#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10307#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {10315#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10311#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {10319#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10315#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {10323#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10319#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {10327#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10323#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {10331#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10327#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {10335#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10331#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {10339#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10335#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {10343#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10339#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {10347#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10343#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {10351#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10347#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {10355#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10351#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {10359#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10355#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {10363#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10359#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {10367#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10363#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {10371#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10367#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {10375#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10371#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {10379#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10375#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {10383#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10379#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {10114#true} ~x~0 := 1;~y~0 := 0; {10383#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:58:05,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {10114#true} call #t~ret5 := main(); {10114#true} is VALID [2022-04-28 02:58:05,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10114#true} {10114#true} #34#return; {10114#true} is VALID [2022-04-28 02:58:05,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {10114#true} assume true; {10114#true} is VALID [2022-04-28 02:58:05,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {10114#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(12, 2);call #Ultimate.allocInit(12, 3); {10114#true} is VALID [2022-04-28 02:58:05,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {10114#true} call ULTIMATE.init(); {10114#true} is VALID [2022-04-28 02:58:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:05,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270022855] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:05,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:05,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-28 02:58:05,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:05,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1931233924] [2022-04-28 02:58:05,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1931233924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:05,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:05,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 02:58:05,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592197678] [2022-04-28 02:58:05,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:05,603 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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 38 [2022-04-28 02:58:05,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:05,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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-28 02:58:05,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:05,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 02:58:05,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:05,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 02:58:05,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=957, Invalid=2583, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 02:58:05,648 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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-28 02:58:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:07,360 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 02:58:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 02:58:07,360 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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 38 [2022-04-28 02:58:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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-28 02:58:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-28 02:58:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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-28 02:58:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-28 02:58:07,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 45 transitions. [2022-04-28 02:58:07,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:07,390 INFO L225 Difference]: With dead ends: 45 [2022-04-28 02:58:07,390 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 02:58:07,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1907, Invalid=5749, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 02:58:07,391 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:07,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 143 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 02:58:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 02:58:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 02:58:07,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:07,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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-28 02:58:07,434 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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-28 02:58:07,434 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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-28 02:58:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:07,435 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 02:58:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 02:58:07,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:07,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:07,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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 40 states. [2022-04-28 02:58:07,435 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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 40 states. [2022-04-28 02:58:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:07,436 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 02:58:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 02:58:07,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:07,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:07,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:07,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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-28 02:58:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-28 02:58:07,437 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-28 02:58:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:07,437 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-28 02:58:07,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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-28 02:58:07,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-28 02:58:07,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 02:58:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 02:58:07,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:07,469 INFO L195 NwaCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:07,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:07,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:07,669 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:07,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:07,670 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 55 times [2022-04-28 02:58:07,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:07,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [868303787] [2022-04-28 02:58:09,897 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:58:10,021 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:10,026 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:10,028 INFO L85 PathProgramCache]: Analyzing trace with hash -271463497, now seen corresponding path program 1 times [2022-04-28 02:58:10,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:10,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771942473] [2022-04-28 02:58:10,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:10,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:10,035 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:58:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:10,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:58:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 56 times [2022-04-28 02:58:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:10,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839808470] [2022-04-28 02:58:10,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:10,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:10,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:10,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {10744#(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(12, 2);call #Ultimate.allocInit(12, 3); {10710#true} is VALID [2022-04-28 02:58:10,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {10710#true} assume true; {10710#true} is VALID [2022-04-28 02:58:10,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10710#true} {10710#true} #34#return; {10710#true} is VALID [2022-04-28 02:58:10,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {10710#true} call ULTIMATE.init(); {10744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:10,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {10744#(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(12, 2);call #Ultimate.allocInit(12, 3); {10710#true} is VALID [2022-04-28 02:58:10,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {10710#true} assume true; {10710#true} is VALID [2022-04-28 02:58:10,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10710#true} {10710#true} #34#return; {10710#true} is VALID [2022-04-28 02:58:10,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {10710#true} call #t~ret5 := main(); {10710#true} is VALID [2022-04-28 02:58:10,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {10710#true} ~x~0 := 1;~y~0 := 0; {10715#(= main_~y~0 0)} is VALID [2022-04-28 02:58:10,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {10715#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10716#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:10,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {10716#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10717#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:10,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {10717#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10718#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:10,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {10718#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10719#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:10,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {10719#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10720#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:10,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {10720#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10721#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:10,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {10721#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10722#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:10,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {10722#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10723#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:10,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {10723#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10724#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:10,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {10724#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10725#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:10,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {10725#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10726#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:10,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {10726#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10727#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:10,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {10727#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10728#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:10,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {10728#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10729#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:10,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {10729#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10730#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:10,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {10730#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10731#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:10,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {10731#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10732#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:10,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {10732#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10733#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:10,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {10733#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10734#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:10,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {10734#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10735#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:10,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {10735#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10736#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:10,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {10736#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10737#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:10,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {10737#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10738#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:10,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {10738#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10739#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:10,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {10739#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10740#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:10,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {10740#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10741#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:10,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {10741#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10742#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:10,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {10742#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10743#(and (<= main_~y~0 28) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:58:10,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {10743#(and (<= main_~y~0 28) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {10711#false} is VALID [2022-04-28 02:58:10,616 INFO L272 TraceCheckUtils]: 35: Hoare triple {10711#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {10711#false} is VALID [2022-04-28 02:58:10,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {10711#false} ~cond := #in~cond; {10711#false} is VALID [2022-04-28 02:58:10,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {10711#false} assume 0 == ~cond; {10711#false} is VALID [2022-04-28 02:58:10,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {10711#false} assume !false; {10711#false} is VALID [2022-04-28 02:58:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:10,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:10,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839808470] [2022-04-28 02:58:10,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839808470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:10,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597109823] [2022-04-28 02:58:10,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:58:10,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:10,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:10,617 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:10,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 02:58:10,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:58:10,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:10,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 02:58:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:10,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:11,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {10710#true} call ULTIMATE.init(); {10710#true} is VALID [2022-04-28 02:58:11,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {10710#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(12, 2);call #Ultimate.allocInit(12, 3); {10710#true} is VALID [2022-04-28 02:58:11,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {10710#true} assume true; {10710#true} is VALID [2022-04-28 02:58:11,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10710#true} {10710#true} #34#return; {10710#true} is VALID [2022-04-28 02:58:11,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {10710#true} call #t~ret5 := main(); {10710#true} is VALID [2022-04-28 02:58:11,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {10710#true} ~x~0 := 1;~y~0 := 0; {10715#(= main_~y~0 0)} is VALID [2022-04-28 02:58:11,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {10715#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10716#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:11,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {10716#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10717#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:11,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {10717#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10718#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:11,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {10718#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10719#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:11,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {10719#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10720#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:11,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {10720#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10721#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:11,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {10721#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10722#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:11,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {10722#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10723#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:11,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {10723#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10724#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:11,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {10724#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10725#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:11,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {10725#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10726#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:11,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {10726#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10727#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:11,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {10727#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10728#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:11,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {10728#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10729#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:11,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {10729#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10730#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:11,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {10730#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10731#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:11,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {10731#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10732#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:11,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {10732#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10733#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:11,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {10733#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10734#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:11,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {10734#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10735#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:11,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {10735#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10736#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:11,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {10736#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10737#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:11,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {10737#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10738#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:11,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {10738#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10739#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:11,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {10739#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10740#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:11,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {10740#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10741#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:11,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {10741#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10742#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:11,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {10742#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10847#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:11,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {10847#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {10711#false} is VALID [2022-04-28 02:58:11,088 INFO L272 TraceCheckUtils]: 35: Hoare triple {10711#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {10711#false} is VALID [2022-04-28 02:58:11,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {10711#false} ~cond := #in~cond; {10711#false} is VALID [2022-04-28 02:58:11,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {10711#false} assume 0 == ~cond; {10711#false} is VALID [2022-04-28 02:58:11,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {10711#false} assume !false; {10711#false} is VALID [2022-04-28 02:58:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:11,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:12,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {10711#false} assume !false; {10711#false} is VALID [2022-04-28 02:58:12,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {10711#false} assume 0 == ~cond; {10711#false} is VALID [2022-04-28 02:58:12,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {10711#false} ~cond := #in~cond; {10711#false} is VALID [2022-04-28 02:58:12,375 INFO L272 TraceCheckUtils]: 35: Hoare triple {10711#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {10711#false} is VALID [2022-04-28 02:58:12,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {10875#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {10711#false} is VALID [2022-04-28 02:58:12,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {10879#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10875#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:58:12,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {10883#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10879#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {10887#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10883#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {10891#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10887#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {10895#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10891#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {10899#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10895#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {10903#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10899#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {10907#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10903#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {10911#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10907#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {10915#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10911#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {10919#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10915#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {10923#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10919#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {10927#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10923#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {10931#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10927#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {10935#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10931#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {10939#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10935#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {10943#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10939#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {10947#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10943#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {10951#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10947#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {10955#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10951#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {10959#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10955#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {10963#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10959#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {10967#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10963#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {10971#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10967#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {10975#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10971#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {10979#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10975#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {10983#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10979#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {10987#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {10983#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {10710#true} ~x~0 := 1;~y~0 := 0; {10987#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 02:58:12,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {10710#true} call #t~ret5 := main(); {10710#true} is VALID [2022-04-28 02:58:12,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10710#true} {10710#true} #34#return; {10710#true} is VALID [2022-04-28 02:58:12,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {10710#true} assume true; {10710#true} is VALID [2022-04-28 02:58:12,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {10710#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(12, 2);call #Ultimate.allocInit(12, 3); {10710#true} is VALID [2022-04-28 02:58:12,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {10710#true} call ULTIMATE.init(); {10710#true} is VALID [2022-04-28 02:58:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:12,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597109823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:12,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:12,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-28 02:58:12,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:12,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [868303787] [2022-04-28 02:58:12,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [868303787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:12,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:12,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 02:58:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373203038] [2022-04-28 02:58:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:12,400 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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 39 [2022-04-28 02:58:12,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:12,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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-28 02:58:12,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:12,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 02:58:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:12,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 02:58:12,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=2762, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 02:58:12,435 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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-28 02:58:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:14,207 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 02:58:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 02:58:14,207 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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 39 [2022-04-28 02:58:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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-28 02:58:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-28 02:58:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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-28 02:58:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-28 02:58:14,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-28 02:58:14,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:14,240 INFO L225 Difference]: With dead ends: 46 [2022-04-28 02:58:14,240 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 02:58:14,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2033, Invalid=6157, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 02:58:14,241 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:14,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 108 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 02:58:14,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 02:58:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 02:58:14,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:14,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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-28 02:58:14,280 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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-28 02:58:14,280 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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-28 02:58:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:14,281 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 02:58:14,281 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 02:58:14,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:14,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:14,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 41 states. [2022-04-28 02:58:14,281 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 41 states. [2022-04-28 02:58:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:14,282 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 02:58:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 02:58:14,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:14,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:14,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:14,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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-28 02:58:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-28 02:58:14,282 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-28 02:58:14,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:14,283 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-28 02:58:14,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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-28 02:58:14,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-28 02:58:14,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:14,314 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 02:58:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 02:58:14,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:14,314 INFO L195 NwaCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:14,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:14,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:14,515 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:14,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:14,515 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 57 times [2022-04-28 02:58:14,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:14,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759953481] [2022-04-28 02:58:14,822 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:14,823 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash -212358153, now seen corresponding path program 1 times [2022-04-28 02:58:14,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:14,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67610035] [2022-04-28 02:58:14,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:14,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:14,847 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:58:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:14,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:58:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 58 times [2022-04-28 02:58:14,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:14,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560459010] [2022-04-28 02:58:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:14,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:15,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:15,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {11357#(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(12, 2);call #Ultimate.allocInit(12, 3); {11322#true} is VALID [2022-04-28 02:58:15,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {11322#true} assume true; {11322#true} is VALID [2022-04-28 02:58:15,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11322#true} {11322#true} #34#return; {11322#true} is VALID [2022-04-28 02:58:15,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {11322#true} call ULTIMATE.init(); {11357#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:15,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {11357#(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(12, 2);call #Ultimate.allocInit(12, 3); {11322#true} is VALID [2022-04-28 02:58:15,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {11322#true} assume true; {11322#true} is VALID [2022-04-28 02:58:15,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11322#true} {11322#true} #34#return; {11322#true} is VALID [2022-04-28 02:58:15,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {11322#true} call #t~ret5 := main(); {11322#true} is VALID [2022-04-28 02:58:15,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {11322#true} ~x~0 := 1;~y~0 := 0; {11327#(= main_~y~0 0)} is VALID [2022-04-28 02:58:15,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {11327#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:15,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {11328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:15,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {11329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:15,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {11330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:15,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {11331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:15,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {11332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:15,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {11333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:15,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {11334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:15,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {11335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:15,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {11336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:15,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {11337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:15,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {11338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:15,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {11339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11340#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:15,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {11340#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11341#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:15,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {11341#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11342#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:15,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {11342#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11343#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:15,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {11343#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11344#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:15,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {11344#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11345#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:15,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {11345#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11346#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:15,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {11346#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11347#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:15,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {11347#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11348#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:15,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {11348#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11349#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:15,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {11349#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11350#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:15,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {11350#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11351#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:15,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {11351#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11352#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:15,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {11352#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11353#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:15,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {11353#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11354#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:15,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {11354#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11355#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:15,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {11355#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11356#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:15,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {11356#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 29))} assume !(~y~0 % 4294967296 < 1024); {11323#false} is VALID [2022-04-28 02:58:15,405 INFO L272 TraceCheckUtils]: 36: Hoare triple {11323#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {11323#false} is VALID [2022-04-28 02:58:15,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {11323#false} ~cond := #in~cond; {11323#false} is VALID [2022-04-28 02:58:15,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {11323#false} assume 0 == ~cond; {11323#false} is VALID [2022-04-28 02:58:15,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {11323#false} assume !false; {11323#false} is VALID [2022-04-28 02:58:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:15,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:15,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560459010] [2022-04-28 02:58:15,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560459010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:15,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398145532] [2022-04-28 02:58:15,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:58:15,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:15,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:15,407 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:15,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 02:58:15,490 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:58:15,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:15,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-28 02:58:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:15,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:15,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {11322#true} call ULTIMATE.init(); {11322#true} is VALID [2022-04-28 02:58:15,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {11322#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(12, 2);call #Ultimate.allocInit(12, 3); {11322#true} is VALID [2022-04-28 02:58:15,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {11322#true} assume true; {11322#true} is VALID [2022-04-28 02:58:15,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11322#true} {11322#true} #34#return; {11322#true} is VALID [2022-04-28 02:58:15,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {11322#true} call #t~ret5 := main(); {11322#true} is VALID [2022-04-28 02:58:15,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {11322#true} ~x~0 := 1;~y~0 := 0; {11327#(= main_~y~0 0)} is VALID [2022-04-28 02:58:15,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {11327#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:15,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {11328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:15,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {11329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:15,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {11330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:15,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {11331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:15,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {11332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:15,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {11333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:15,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {11334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:15,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {11335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:15,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {11336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:15,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {11337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:15,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {11338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:15,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {11339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11340#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:15,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {11340#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11341#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:15,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {11341#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11342#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:15,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {11342#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11343#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:15,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {11343#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11344#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:15,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {11344#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11345#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:15,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {11345#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11346#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:15,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {11346#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11347#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:15,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {11347#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11348#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:15,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {11348#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11349#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:15,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {11349#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11350#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:15,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {11350#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11351#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:15,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {11351#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11352#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:15,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {11352#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11353#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:15,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {11353#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11354#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:15,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {11354#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11355#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:15,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {11355#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11463#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:15,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {11463#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !(~y~0 % 4294967296 < 1024); {11323#false} is VALID [2022-04-28 02:58:15,862 INFO L272 TraceCheckUtils]: 36: Hoare triple {11323#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {11323#false} is VALID [2022-04-28 02:58:15,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {11323#false} ~cond := #in~cond; {11323#false} is VALID [2022-04-28 02:58:15,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {11323#false} assume 0 == ~cond; {11323#false} is VALID [2022-04-28 02:58:15,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {11323#false} assume !false; {11323#false} is VALID [2022-04-28 02:58:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:15,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:17,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {11323#false} assume !false; {11323#false} is VALID [2022-04-28 02:58:17,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {11323#false} assume 0 == ~cond; {11323#false} is VALID [2022-04-28 02:58:17,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {11323#false} ~cond := #in~cond; {11323#false} is VALID [2022-04-28 02:58:17,266 INFO L272 TraceCheckUtils]: 36: Hoare triple {11323#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {11323#false} is VALID [2022-04-28 02:58:17,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {11491#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {11323#false} is VALID [2022-04-28 02:58:17,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {11495#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11491#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:58:17,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {11499#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11495#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {11503#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11499#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {11507#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11503#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {11511#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11507#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {11515#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11511#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {11519#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11515#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {11523#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11519#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {11527#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11523#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {11531#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11527#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {11535#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11531#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {11539#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11535#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {11543#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11539#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {11547#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11543#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {11551#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11547#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {11555#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11551#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {11559#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11555#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {11563#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11559#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {11567#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11563#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {11571#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11567#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {11575#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11571#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {11579#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11575#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {11583#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11579#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {11587#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11583#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {11591#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11587#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {11595#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11591#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {11599#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11595#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {11603#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11599#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {11607#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11603#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {11322#true} ~x~0 := 1;~y~0 := 0; {11607#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:17,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {11322#true} call #t~ret5 := main(); {11322#true} is VALID [2022-04-28 02:58:17,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11322#true} {11322#true} #34#return; {11322#true} is VALID [2022-04-28 02:58:17,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {11322#true} assume true; {11322#true} is VALID [2022-04-28 02:58:17,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {11322#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(12, 2);call #Ultimate.allocInit(12, 3); {11322#true} is VALID [2022-04-28 02:58:17,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {11322#true} call ULTIMATE.init(); {11322#true} is VALID [2022-04-28 02:58:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:17,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398145532] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:17,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:17,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-28 02:58:17,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:17,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759953481] [2022-04-28 02:58:17,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759953481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:17,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:17,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 02:58:17,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078983684] [2022-04-28 02:58:17,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:17,300 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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 40 [2022-04-28 02:58:17,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:17,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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-28 02:58:17,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:17,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 02:58:17,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:17,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 02:58:17,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=2947, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 02:58:17,322 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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-28 02:58:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:19,266 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 02:58:19,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 02:58:19,266 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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 40 [2022-04-28 02:58:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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-28 02:58:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-28 02:58:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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-28 02:58:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-28 02:58:19,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-28 02:58:19,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:19,309 INFO L225 Difference]: With dead ends: 47 [2022-04-28 02:58:19,309 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 02:58:19,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2163, Invalid=6579, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 02:58:19,310 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:19,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 02:58:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 02:58:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 02:58:19,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:19,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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-28 02:58:19,349 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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-28 02:58:19,349 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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-28 02:58:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:19,349 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 02:58:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 02:58:19,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:19,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:19,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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 42 states. [2022-04-28 02:58:19,350 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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 42 states. [2022-04-28 02:58:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:19,350 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 02:58:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 02:58:19,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:19,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:19,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:19,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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-28 02:58:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-28 02:58:19,351 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-28 02:58:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:19,351 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-28 02:58:19,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 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-28 02:58:19,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-28 02:58:19,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 02:58:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 02:58:19,384 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:19,384 INFO L195 NwaCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:19,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:19,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2022-04-28 02:58:19,595 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:19,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 59 times [2022-04-28 02:58:19,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:19,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [462543871] [2022-04-28 02:58:21,040 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:21,041 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash -153252809, now seen corresponding path program 1 times [2022-04-28 02:58:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:21,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437164602] [2022-04-28 02:58:21,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:21,054 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:58:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:21,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:58:21,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 60 times [2022-04-28 02:58:21,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:21,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974822913] [2022-04-28 02:58:21,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:21,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:21,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {11986#(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(12, 2);call #Ultimate.allocInit(12, 3); {11950#true} is VALID [2022-04-28 02:58:21,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {11950#true} assume true; {11950#true} is VALID [2022-04-28 02:58:21,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11950#true} {11950#true} #34#return; {11950#true} is VALID [2022-04-28 02:58:21,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {11950#true} call ULTIMATE.init(); {11986#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:21,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {11986#(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(12, 2);call #Ultimate.allocInit(12, 3); {11950#true} is VALID [2022-04-28 02:58:21,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {11950#true} assume true; {11950#true} is VALID [2022-04-28 02:58:21,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11950#true} {11950#true} #34#return; {11950#true} is VALID [2022-04-28 02:58:21,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {11950#true} call #t~ret5 := main(); {11950#true} is VALID [2022-04-28 02:58:21,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {11950#true} ~x~0 := 1;~y~0 := 0; {11955#(= main_~y~0 0)} is VALID [2022-04-28 02:58:21,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {11955#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11956#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:21,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {11956#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11957#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:21,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {11957#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:21,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {11958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11959#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:21,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {11959#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11960#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:21,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {11960#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11961#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:21,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {11961#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11962#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:21,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {11962#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11963#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:21,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {11963#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11964#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:21,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {11964#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11965#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:21,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {11965#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11966#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:21,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {11966#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11967#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:21,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {11967#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11968#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:21,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {11968#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11969#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:21,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {11969#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11970#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:21,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {11970#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11971#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:21,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {11971#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11972#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:21,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {11972#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11973#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:21,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {11973#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11974#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:21,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {11974#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11975#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:21,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {11975#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11976#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:21,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {11976#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11977#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:21,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {11977#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11978#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:21,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {11978#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11979#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:21,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {11979#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11980#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:21,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {11980#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11981#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:21,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {11981#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11982#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:21,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {11982#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11983#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:21,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {11983#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11984#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:21,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {11984#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11985#(and (<= main_~y~0 30) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:58:21,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {11985#(and (<= main_~y~0 30) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {11951#false} is VALID [2022-04-28 02:58:21,649 INFO L272 TraceCheckUtils]: 37: Hoare triple {11951#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {11951#false} is VALID [2022-04-28 02:58:21,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {11951#false} ~cond := #in~cond; {11951#false} is VALID [2022-04-28 02:58:21,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {11951#false} assume 0 == ~cond; {11951#false} is VALID [2022-04-28 02:58:21,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {11951#false} assume !false; {11951#false} is VALID [2022-04-28 02:58:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:21,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:21,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974822913] [2022-04-28 02:58:21,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974822913] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:21,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546361149] [2022-04-28 02:58:21,650 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:58:21,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:21,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:21,651 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:21,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 02:58:23,134 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 02:58:23,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:23,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-28 02:58:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:23,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:23,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {11950#true} call ULTIMATE.init(); {11950#true} is VALID [2022-04-28 02:58:23,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {11950#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(12, 2);call #Ultimate.allocInit(12, 3); {11950#true} is VALID [2022-04-28 02:58:23,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {11950#true} assume true; {11950#true} is VALID [2022-04-28 02:58:23,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11950#true} {11950#true} #34#return; {11950#true} is VALID [2022-04-28 02:58:23,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {11950#true} call #t~ret5 := main(); {11950#true} is VALID [2022-04-28 02:58:23,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {11950#true} ~x~0 := 1;~y~0 := 0; {11955#(= main_~y~0 0)} is VALID [2022-04-28 02:58:23,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {11955#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11956#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:23,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {11956#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11957#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:23,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {11957#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:23,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {11958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11959#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:23,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {11959#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11960#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:23,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {11960#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11961#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:23,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {11961#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11962#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:23,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {11962#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11963#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:23,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {11963#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11964#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:23,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {11964#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11965#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:23,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {11965#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11966#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:23,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {11966#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11967#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:23,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {11967#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11968#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:23,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {11968#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11969#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:23,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {11969#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11970#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:23,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {11970#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11971#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:23,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {11971#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11972#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:23,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {11972#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11973#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:23,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {11973#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11974#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:23,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {11974#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11975#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:23,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {11975#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11976#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:23,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {11976#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11977#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:23,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {11977#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11978#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:23,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {11978#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11979#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:23,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {11979#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11980#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:23,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {11980#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11981#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:23,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {11981#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11982#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:23,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {11982#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11983#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:23,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {11983#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {11984#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:23,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {11984#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12095#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:58:23,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {12095#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {11951#false} is VALID [2022-04-28 02:58:23,523 INFO L272 TraceCheckUtils]: 37: Hoare triple {11951#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {11951#false} is VALID [2022-04-28 02:58:23,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {11951#false} ~cond := #in~cond; {11951#false} is VALID [2022-04-28 02:58:23,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {11951#false} assume 0 == ~cond; {11951#false} is VALID [2022-04-28 02:58:23,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {11951#false} assume !false; {11951#false} is VALID [2022-04-28 02:58:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:23,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:25,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {11951#false} assume !false; {11951#false} is VALID [2022-04-28 02:58:25,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {11951#false} assume 0 == ~cond; {11951#false} is VALID [2022-04-28 02:58:25,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {11951#false} ~cond := #in~cond; {11951#false} is VALID [2022-04-28 02:58:25,008 INFO L272 TraceCheckUtils]: 37: Hoare triple {11951#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {11951#false} is VALID [2022-04-28 02:58:25,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {12123#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {11951#false} is VALID [2022-04-28 02:58:25,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {12127#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12123#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:58:25,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {12131#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12127#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {12135#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12131#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {12139#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12135#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {12143#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12139#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {12147#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12143#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {12151#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12147#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {12155#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12151#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {12159#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12155#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {12163#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12159#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {12167#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12163#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {12171#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12167#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {12175#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12171#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {12179#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12175#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {12183#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12179#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {12187#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12183#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {12191#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12187#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {12195#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12191#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {12199#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12195#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {12203#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12199#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {12207#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12203#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {12211#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12207#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {12215#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12211#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {12219#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12215#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {12223#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12219#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {12227#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12223#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {12231#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12227#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {12235#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12231#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {12239#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12235#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {12243#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12239#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {11950#true} ~x~0 := 1;~y~0 := 0; {12243#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:25,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {11950#true} call #t~ret5 := main(); {11950#true} is VALID [2022-04-28 02:58:25,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11950#true} {11950#true} #34#return; {11950#true} is VALID [2022-04-28 02:58:25,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {11950#true} assume true; {11950#true} is VALID [2022-04-28 02:58:25,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {11950#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(12, 2);call #Ultimate.allocInit(12, 3); {11950#true} is VALID [2022-04-28 02:58:25,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {11950#true} call ULTIMATE.init(); {11950#true} is VALID [2022-04-28 02:58:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:25,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546361149] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:25,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:25,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-28 02:58:25,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:25,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [462543871] [2022-04-28 02:58:25,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [462543871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:25,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:25,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 02:58:25,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077169092] [2022-04-28 02:58:25,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:25,029 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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 41 [2022-04-28 02:58:25,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:25,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-28 02:58:25,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:25,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 02:58:25,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:25,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 02:58:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1152, Invalid=3138, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 02:58:25,055 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-28 02:58:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:27,028 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 02:58:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 02:58:27,028 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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 41 [2022-04-28 02:58:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-28 02:58:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-28 02:58:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-28 02:58:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-28 02:58:27,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-28 02:58:27,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:27,058 INFO L225 Difference]: With dead ends: 48 [2022-04-28 02:58:27,058 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 02:58:27,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2297, Invalid=7015, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 02:58:27,059 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:27,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 108 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 02:58:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 02:58:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 02:58:27,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:27,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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-28 02:58:27,100 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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-28 02:58:27,100 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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-28 02:58:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:27,100 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 02:58:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 02:58:27,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:27,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:27,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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 43 states. [2022-04-28 02:58:27,101 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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 43 states. [2022-04-28 02:58:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:27,101 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 02:58:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 02:58:27,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:27,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:27,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:27,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 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-28 02:58:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-28 02:58:27,102 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-28 02:58:27,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:27,102 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-28 02:58:27,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-28 02:58:27,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-28 02:58:27,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 02:58:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 02:58:27,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:27,133 INFO L195 NwaCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:27,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-28 02:58:27,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61 [2022-04-28 02:58:27,334 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:27,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:27,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 61 times [2022-04-28 02:58:27,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:27,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1456706520] [2022-04-28 02:58:27,658 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:27,659 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash -94147465, now seen corresponding path program 1 times [2022-04-28 02:58:27,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:27,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617065007] [2022-04-28 02:58:27,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:27,666 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:58:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:27,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:58:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 62 times [2022-04-28 02:58:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:27,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699487357] [2022-04-28 02:58:27,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:27,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:28,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {12631#(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(12, 2);call #Ultimate.allocInit(12, 3); {12594#true} is VALID [2022-04-28 02:58:28,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {12594#true} assume true; {12594#true} is VALID [2022-04-28 02:58:28,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12594#true} {12594#true} #34#return; {12594#true} is VALID [2022-04-28 02:58:28,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {12594#true} call ULTIMATE.init(); {12631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:28,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {12631#(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(12, 2);call #Ultimate.allocInit(12, 3); {12594#true} is VALID [2022-04-28 02:58:28,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {12594#true} assume true; {12594#true} is VALID [2022-04-28 02:58:28,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12594#true} {12594#true} #34#return; {12594#true} is VALID [2022-04-28 02:58:28,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {12594#true} call #t~ret5 := main(); {12594#true} is VALID [2022-04-28 02:58:28,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {12594#true} ~x~0 := 1;~y~0 := 0; {12599#(= main_~y~0 0)} is VALID [2022-04-28 02:58:28,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {12599#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12600#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:28,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {12600#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12601#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:28,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {12601#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12602#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:28,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {12602#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12603#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:28,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {12603#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12604#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:28,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {12604#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12605#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:28,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {12605#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12606#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:28,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {12606#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12607#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:28,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {12607#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12608#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:28,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {12608#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12609#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:28,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {12609#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12610#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:28,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {12610#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12611#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:28,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {12611#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12612#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:28,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {12612#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12613#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:28,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {12613#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12614#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:28,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {12614#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12615#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:28,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {12615#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12616#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:28,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {12616#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12617#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:28,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {12617#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12618#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:28,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {12618#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12619#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:28,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {12619#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12620#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:28,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {12620#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12621#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {12621#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12622#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {12622#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12623#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:28,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {12623#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12624#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:28,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {12624#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12625#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:28,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {12625#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12626#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:28,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {12626#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12627#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:28,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {12627#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12628#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:28,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {12628#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12629#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:58:28,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {12629#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12630#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 31))} is VALID [2022-04-28 02:58:28,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {12630#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 31))} assume !(~y~0 % 4294967296 < 1024); {12595#false} is VALID [2022-04-28 02:58:28,300 INFO L272 TraceCheckUtils]: 38: Hoare triple {12595#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {12595#false} is VALID [2022-04-28 02:58:28,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {12595#false} ~cond := #in~cond; {12595#false} is VALID [2022-04-28 02:58:28,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {12595#false} assume 0 == ~cond; {12595#false} is VALID [2022-04-28 02:58:28,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {12595#false} assume !false; {12595#false} is VALID [2022-04-28 02:58:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:28,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:28,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699487357] [2022-04-28 02:58:28,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699487357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:28,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498001076] [2022-04-28 02:58:28,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:58:28,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:28,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:28,302 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:28,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 02:58:28,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:58:28,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:28,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-28 02:58:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:28,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:28,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {12594#true} call ULTIMATE.init(); {12594#true} is VALID [2022-04-28 02:58:28,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {12594#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(12, 2);call #Ultimate.allocInit(12, 3); {12594#true} is VALID [2022-04-28 02:58:28,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {12594#true} assume true; {12594#true} is VALID [2022-04-28 02:58:28,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12594#true} {12594#true} #34#return; {12594#true} is VALID [2022-04-28 02:58:28,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {12594#true} call #t~ret5 := main(); {12594#true} is VALID [2022-04-28 02:58:28,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {12594#true} ~x~0 := 1;~y~0 := 0; {12599#(= main_~y~0 0)} is VALID [2022-04-28 02:58:28,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {12599#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12600#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:28,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {12600#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12601#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:28,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {12601#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12602#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:28,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {12602#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12603#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:28,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {12603#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12604#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:28,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {12604#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12605#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:28,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {12605#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12606#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:28,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {12606#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12607#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:28,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {12607#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12608#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:28,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {12608#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12609#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:28,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {12609#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12610#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:28,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {12610#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12611#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:28,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {12611#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12612#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:28,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {12612#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12613#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:28,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {12613#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12614#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:28,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {12614#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12615#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:28,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {12615#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12616#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:28,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {12616#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12617#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:28,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {12617#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12618#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:28,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {12618#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12619#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:28,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {12619#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12620#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:28,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {12620#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12621#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:28,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {12621#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12622#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:28,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {12622#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12623#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:28,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {12623#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12624#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:28,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {12624#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12625#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:28,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {12625#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12626#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:28,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {12626#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12627#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:28,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {12627#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12628#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:28,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {12628#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12629#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:58:28,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {12629#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12743#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:58:28,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {12743#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {12595#false} is VALID [2022-04-28 02:58:28,781 INFO L272 TraceCheckUtils]: 38: Hoare triple {12595#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {12595#false} is VALID [2022-04-28 02:58:28,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {12595#false} ~cond := #in~cond; {12595#false} is VALID [2022-04-28 02:58:28,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {12595#false} assume 0 == ~cond; {12595#false} is VALID [2022-04-28 02:58:28,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {12595#false} assume !false; {12595#false} is VALID [2022-04-28 02:58:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:28,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:30,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {12595#false} assume !false; {12595#false} is VALID [2022-04-28 02:58:30,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {12595#false} assume 0 == ~cond; {12595#false} is VALID [2022-04-28 02:58:30,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {12595#false} ~cond := #in~cond; {12595#false} is VALID [2022-04-28 02:58:30,316 INFO L272 TraceCheckUtils]: 38: Hoare triple {12595#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {12595#false} is VALID [2022-04-28 02:58:30,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {12771#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {12595#false} is VALID [2022-04-28 02:58:30,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {12775#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12771#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:58:30,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {12779#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12775#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {12783#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12779#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {12787#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12783#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {12791#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12787#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {12795#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12791#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {12799#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12795#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {12803#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12799#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {12807#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12803#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {12811#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12807#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {12815#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12811#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {12819#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12815#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {12823#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12819#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {12827#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12823#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {12831#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12827#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {12835#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12831#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {12839#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12835#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {12843#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12839#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {12847#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12843#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {12851#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12847#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {12855#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12851#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {12859#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12855#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {12863#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12859#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {12867#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12863#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {12871#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12867#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {12875#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12871#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {12879#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12875#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {12883#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12879#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {12887#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12883#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {12891#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12887#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {12895#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {12891#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {12594#true} ~x~0 := 1;~y~0 := 0; {12895#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 02:58:30,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {12594#true} call #t~ret5 := main(); {12594#true} is VALID [2022-04-28 02:58:30,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12594#true} {12594#true} #34#return; {12594#true} is VALID [2022-04-28 02:58:30,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {12594#true} assume true; {12594#true} is VALID [2022-04-28 02:58:30,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {12594#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(12, 2);call #Ultimate.allocInit(12, 3); {12594#true} is VALID [2022-04-28 02:58:30,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {12594#true} call ULTIMATE.init(); {12594#true} is VALID [2022-04-28 02:58:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:30,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498001076] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:30,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:30,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-28 02:58:30,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:30,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1456706520] [2022-04-28 02:58:30,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1456706520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:30,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:30,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 02:58:30,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824412659] [2022-04-28 02:58:30,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:30,346 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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 42 [2022-04-28 02:58:30,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:30,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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-28 02:58:30,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:30,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 02:58:30,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:30,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 02:58:30,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1221, Invalid=3335, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 02:58:30,369 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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-28 02:58:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:32,344 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 02:58:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 02:58:32,344 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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 42 [2022-04-28 02:58:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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-28 02:58:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-28 02:58:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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-28 02:58:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-28 02:58:32,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 49 transitions. [2022-04-28 02:58:32,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:32,379 INFO L225 Difference]: With dead ends: 49 [2022-04-28 02:58:32,379 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 02:58:32,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2435, Invalid=7465, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 02:58:32,380 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:32,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 02:58:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 02:58:32,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 02:58:32,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:32,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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-28 02:58:32,439 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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-28 02:58:32,439 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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-28 02:58:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:32,440 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 02:58:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 02:58:32,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:32,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:32,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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 44 states. [2022-04-28 02:58:32,440 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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 44 states. [2022-04-28 02:58:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:32,441 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 02:58:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 02:58:32,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:32,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:32,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:32,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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-28 02:58:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-28 02:58:32,442 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-28 02:58:32,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:32,442 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-28 02:58:32,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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-28 02:58:32,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-28 02:58:32,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 02:58:32,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 02:58:32,477 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:32,477 INFO L195 NwaCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:32,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:32,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:32,694 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:32,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 63 times [2022-04-28 02:58:32,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:32,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1810582404] [2022-04-28 02:58:32,975 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:32,976 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:32,978 INFO L85 PathProgramCache]: Analyzing trace with hash -35042121, now seen corresponding path program 1 times [2022-04-28 02:58:32,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:32,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610774203] [2022-04-28 02:58:32,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:32,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:32,984 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:58:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:32,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:58:32,997 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 64 times [2022-04-28 02:58:32,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:32,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377808740] [2022-04-28 02:58:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:32,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:33,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:33,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {13292#(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(12, 2);call #Ultimate.allocInit(12, 3); {13254#true} is VALID [2022-04-28 02:58:33,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {13254#true} assume true; {13254#true} is VALID [2022-04-28 02:58:33,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13254#true} {13254#true} #34#return; {13254#true} is VALID [2022-04-28 02:58:33,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {13254#true} call ULTIMATE.init(); {13292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:33,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {13292#(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(12, 2);call #Ultimate.allocInit(12, 3); {13254#true} is VALID [2022-04-28 02:58:33,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {13254#true} assume true; {13254#true} is VALID [2022-04-28 02:58:33,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13254#true} {13254#true} #34#return; {13254#true} is VALID [2022-04-28 02:58:33,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {13254#true} call #t~ret5 := main(); {13254#true} is VALID [2022-04-28 02:58:33,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {13254#true} ~x~0 := 1;~y~0 := 0; {13259#(= main_~y~0 0)} is VALID [2022-04-28 02:58:33,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {13259#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13260#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:33,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {13260#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13261#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:33,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {13261#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13262#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:33,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {13262#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13263#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:33,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {13263#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13264#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:33,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {13264#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13265#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:33,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {13265#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13266#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:33,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {13266#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13267#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:33,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {13267#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13268#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:33,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {13268#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13269#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:33,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {13269#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13270#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:33,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {13270#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13271#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:33,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {13271#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13272#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:33,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {13272#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13273#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:33,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {13273#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13274#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:33,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {13274#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13275#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:33,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {13275#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13276#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:33,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {13276#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13277#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:33,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {13277#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13278#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:33,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {13278#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13279#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:33,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {13279#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13280#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:33,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {13280#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13281#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:33,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {13281#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13282#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:33,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {13282#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13283#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:33,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {13283#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13284#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:33,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {13284#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13285#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:33,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {13285#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13286#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:33,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {13286#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13287#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:33,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {13287#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13288#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:33,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {13288#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13289#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:58:33,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {13289#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13290#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:58:33,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {13290#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13291#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 32))} is VALID [2022-04-28 02:58:33,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {13291#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 32))} assume !(~y~0 % 4294967296 < 1024); {13255#false} is VALID [2022-04-28 02:58:33,647 INFO L272 TraceCheckUtils]: 39: Hoare triple {13255#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {13255#false} is VALID [2022-04-28 02:58:33,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {13255#false} ~cond := #in~cond; {13255#false} is VALID [2022-04-28 02:58:33,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {13255#false} assume 0 == ~cond; {13255#false} is VALID [2022-04-28 02:58:33,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {13255#false} assume !false; {13255#false} is VALID [2022-04-28 02:58:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:33,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:33,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377808740] [2022-04-28 02:58:33,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377808740] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:33,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268183787] [2022-04-28 02:58:33,648 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:58:33,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:33,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:33,649 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:33,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 02:58:33,748 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:58:33,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:33,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-28 02:58:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:33,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:34,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {13254#true} call ULTIMATE.init(); {13254#true} is VALID [2022-04-28 02:58:34,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {13254#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(12, 2);call #Ultimate.allocInit(12, 3); {13254#true} is VALID [2022-04-28 02:58:34,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {13254#true} assume true; {13254#true} is VALID [2022-04-28 02:58:34,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13254#true} {13254#true} #34#return; {13254#true} is VALID [2022-04-28 02:58:34,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {13254#true} call #t~ret5 := main(); {13254#true} is VALID [2022-04-28 02:58:34,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {13254#true} ~x~0 := 1;~y~0 := 0; {13259#(= main_~y~0 0)} is VALID [2022-04-28 02:58:34,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {13259#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13260#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:34,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {13260#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13261#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:34,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {13261#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13262#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:34,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {13262#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13263#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:34,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {13263#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13264#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:34,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {13264#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13265#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:34,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {13265#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13266#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:34,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {13266#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13267#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:34,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {13267#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13268#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:34,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {13268#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13269#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:34,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {13269#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13270#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:34,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {13270#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13271#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:34,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {13271#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13272#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:34,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {13272#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13273#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:34,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {13273#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13274#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:34,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {13274#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13275#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:34,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {13275#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13276#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:34,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {13276#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13277#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:34,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {13277#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13278#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:34,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {13278#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13279#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:34,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {13279#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13280#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:34,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {13280#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13281#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:34,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {13281#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13282#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:34,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {13282#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13283#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:34,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {13283#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13284#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:34,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {13284#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13285#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:34,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {13285#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13286#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:34,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {13286#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13287#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:34,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {13287#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13288#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:34,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {13288#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13289#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:58:34,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {13289#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13290#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:58:34,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {13290#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13407#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:58:34,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {13407#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {13255#false} is VALID [2022-04-28 02:58:34,150 INFO L272 TraceCheckUtils]: 39: Hoare triple {13255#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {13255#false} is VALID [2022-04-28 02:58:34,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {13255#false} ~cond := #in~cond; {13255#false} is VALID [2022-04-28 02:58:34,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {13255#false} assume 0 == ~cond; {13255#false} is VALID [2022-04-28 02:58:34,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {13255#false} assume !false; {13255#false} is VALID [2022-04-28 02:58:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:34,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:35,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {13255#false} assume !false; {13255#false} is VALID [2022-04-28 02:58:35,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {13255#false} assume 0 == ~cond; {13255#false} is VALID [2022-04-28 02:58:35,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {13255#false} ~cond := #in~cond; {13255#false} is VALID [2022-04-28 02:58:35,809 INFO L272 TraceCheckUtils]: 39: Hoare triple {13255#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {13255#false} is VALID [2022-04-28 02:58:35,809 INFO L290 TraceCheckUtils]: 38: Hoare triple {13435#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {13255#false} is VALID [2022-04-28 02:58:35,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {13439#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13435#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:58:35,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {13443#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13439#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {13447#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13443#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {13451#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13447#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {13455#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13451#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {13459#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13455#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {13463#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13459#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {13467#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13463#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {13471#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13467#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {13475#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13471#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {13479#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13475#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {13483#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13479#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {13487#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13483#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {13491#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13487#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {13495#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13491#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {13499#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13495#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {13503#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13499#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {13507#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13503#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {13511#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13507#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {13515#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13511#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {13519#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13515#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {13523#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13519#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {13527#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13523#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {13531#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13527#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {13535#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13531#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {13539#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13535#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {13543#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13539#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {13547#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13543#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {13551#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13547#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {13555#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13551#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {13559#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13555#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {13563#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13559#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {13254#true} ~x~0 := 1;~y~0 := 0; {13563#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:35,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {13254#true} call #t~ret5 := main(); {13254#true} is VALID [2022-04-28 02:58:35,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13254#true} {13254#true} #34#return; {13254#true} is VALID [2022-04-28 02:58:35,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {13254#true} assume true; {13254#true} is VALID [2022-04-28 02:58:35,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {13254#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(12, 2);call #Ultimate.allocInit(12, 3); {13254#true} is VALID [2022-04-28 02:58:35,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {13254#true} call ULTIMATE.init(); {13254#true} is VALID [2022-04-28 02:58:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:35,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268183787] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:35,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:35,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-28 02:58:35,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:35,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1810582404] [2022-04-28 02:58:35,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1810582404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:35,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:35,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 02:58:35,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721014585] [2022-04-28 02:58:35,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:35,831 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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 43 [2022-04-28 02:58:35,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:35,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-28 02:58:35,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:35,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 02:58:35,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:35,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 02:58:35,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1292, Invalid=3538, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 02:58:35,857 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-28 02:58:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:38,132 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 02:58:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 02:58:38,133 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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 43 [2022-04-28 02:58:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-28 02:58:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-28 02:58:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-28 02:58:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-28 02:58:38,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-28 02:58:38,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:38,175 INFO L225 Difference]: With dead ends: 50 [2022-04-28 02:58:38,175 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 02:58:38,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2577, Invalid=7929, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 02:58:38,176 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:38,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 148 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 02:58:38,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 02:58:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 02:58:38,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:38,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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-28 02:58:38,218 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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-28 02:58:38,218 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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-28 02:58:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:38,218 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 02:58:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 02:58:38,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:38,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:38,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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 45 states. [2022-04-28 02:58:38,219 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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 45 states. [2022-04-28 02:58:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:38,219 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 02:58:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 02:58:38,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:38,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:38,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:38,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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-28 02:58:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-28 02:58:38,220 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-28 02:58:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:38,220 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-28 02:58:38,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-28 02:58:38,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-28 02:58:38,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 02:58:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 02:58:38,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:38,258 INFO L195 NwaCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:38,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:38,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:38,459 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:38,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:38,459 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 65 times [2022-04-28 02:58:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:38,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [365194247] [2022-04-28 02:58:40,271 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:58:40,432 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:40,433 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash 24063223, now seen corresponding path program 1 times [2022-04-28 02:58:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:40,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726540422] [2022-04-28 02:58:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:40,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:40,439 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:58:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:40,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:58:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 66 times [2022-04-28 02:58:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:40,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476328294] [2022-04-28 02:58:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:40,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:41,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:41,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {13969#(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(12, 2);call #Ultimate.allocInit(12, 3); {13930#true} is VALID [2022-04-28 02:58:41,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {13930#true} assume true; {13930#true} is VALID [2022-04-28 02:58:41,138 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13930#true} {13930#true} #34#return; {13930#true} is VALID [2022-04-28 02:58:41,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {13930#true} call ULTIMATE.init(); {13969#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:41,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {13969#(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(12, 2);call #Ultimate.allocInit(12, 3); {13930#true} is VALID [2022-04-28 02:58:41,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {13930#true} assume true; {13930#true} is VALID [2022-04-28 02:58:41,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13930#true} {13930#true} #34#return; {13930#true} is VALID [2022-04-28 02:58:41,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {13930#true} call #t~ret5 := main(); {13930#true} is VALID [2022-04-28 02:58:41,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {13930#true} ~x~0 := 1;~y~0 := 0; {13935#(= main_~y~0 0)} is VALID [2022-04-28 02:58:41,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {13935#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13936#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:41,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {13936#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13937#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:41,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {13937#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13938#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:41,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {13938#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13939#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:41,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {13939#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13940#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:41,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {13940#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13941#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:41,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {13941#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13942#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:41,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {13942#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13943#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:41,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {13943#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13944#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:41,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {13944#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13945#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:41,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {13945#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13946#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:41,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {13946#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13947#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:41,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {13947#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13948#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:41,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {13948#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13949#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:41,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {13949#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13950#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:41,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {13950#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13951#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:41,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {13951#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13952#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:41,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {13952#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13953#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:41,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {13953#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13954#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:41,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {13954#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13955#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:41,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {13955#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13956#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:41,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {13956#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13957#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:41,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {13957#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13958#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:41,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {13958#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13959#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:41,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {13959#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13960#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:41,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {13960#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13961#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:41,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {13961#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13962#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:41,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {13962#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13963#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:41,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {13963#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13964#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:41,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {13964#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13965#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:58:41,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {13965#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13966#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:58:41,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {13966#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13967#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:58:41,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {13967#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13968#(and (<= main_~y~0 33) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:58:41,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {13968#(and (<= main_~y~0 33) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {13931#false} is VALID [2022-04-28 02:58:41,155 INFO L272 TraceCheckUtils]: 40: Hoare triple {13931#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {13931#false} is VALID [2022-04-28 02:58:41,155 INFO L290 TraceCheckUtils]: 41: Hoare triple {13931#false} ~cond := #in~cond; {13931#false} is VALID [2022-04-28 02:58:41,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {13931#false} assume 0 == ~cond; {13931#false} is VALID [2022-04-28 02:58:41,155 INFO L290 TraceCheckUtils]: 43: Hoare triple {13931#false} assume !false; {13931#false} is VALID [2022-04-28 02:58:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:41,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:41,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476328294] [2022-04-28 02:58:41,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476328294] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:41,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915565132] [2022-04-28 02:58:41,156 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:58:41,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:41,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:41,157 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:41,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 02:58:42,271 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-28 02:58:42,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:42,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-28 02:58:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:42,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:42,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {13930#true} call ULTIMATE.init(); {13930#true} is VALID [2022-04-28 02:58:42,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {13930#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(12, 2);call #Ultimate.allocInit(12, 3); {13930#true} is VALID [2022-04-28 02:58:42,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {13930#true} assume true; {13930#true} is VALID [2022-04-28 02:58:42,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13930#true} {13930#true} #34#return; {13930#true} is VALID [2022-04-28 02:58:42,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {13930#true} call #t~ret5 := main(); {13930#true} is VALID [2022-04-28 02:58:42,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {13930#true} ~x~0 := 1;~y~0 := 0; {13935#(= main_~y~0 0)} is VALID [2022-04-28 02:58:42,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {13935#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13936#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:42,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {13936#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13937#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:42,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {13937#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13938#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:42,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {13938#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13939#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:42,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {13939#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13940#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:42,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {13940#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13941#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:42,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {13941#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13942#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:42,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {13942#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13943#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:42,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {13943#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13944#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:42,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {13944#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13945#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:42,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {13945#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13946#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:42,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {13946#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13947#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:42,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {13947#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13948#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:42,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {13948#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13949#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:42,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {13949#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13950#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:42,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {13950#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13951#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:42,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {13951#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13952#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:42,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {13952#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13953#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:42,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {13953#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13954#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:42,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {13954#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13955#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:42,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {13955#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13956#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:42,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {13956#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13957#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:42,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {13957#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13958#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:42,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {13958#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13959#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:42,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {13959#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13960#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:42,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {13960#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13961#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:42,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {13961#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13962#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:42,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {13962#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13963#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:42,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {13963#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13964#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:42,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {13964#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13965#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:58:42,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {13965#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13966#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:58:42,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {13966#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {13967#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:58:42,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {13967#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14087#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:58:42,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {14087#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !(~y~0 % 4294967296 < 1024); {13931#false} is VALID [2022-04-28 02:58:42,674 INFO L272 TraceCheckUtils]: 40: Hoare triple {13931#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {13931#false} is VALID [2022-04-28 02:58:42,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {13931#false} ~cond := #in~cond; {13931#false} is VALID [2022-04-28 02:58:42,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {13931#false} assume 0 == ~cond; {13931#false} is VALID [2022-04-28 02:58:42,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {13931#false} assume !false; {13931#false} is VALID [2022-04-28 02:58:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:42,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:44,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {13931#false} assume !false; {13931#false} is VALID [2022-04-28 02:58:44,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {13931#false} assume 0 == ~cond; {13931#false} is VALID [2022-04-28 02:58:44,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {13931#false} ~cond := #in~cond; {13931#false} is VALID [2022-04-28 02:58:44,411 INFO L272 TraceCheckUtils]: 40: Hoare triple {13931#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {13931#false} is VALID [2022-04-28 02:58:44,411 INFO L290 TraceCheckUtils]: 39: Hoare triple {14115#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {13931#false} is VALID [2022-04-28 02:58:44,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {14119#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14115#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:58:44,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {14123#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14119#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {14127#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14123#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {14131#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14127#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {14135#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14131#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {14139#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14135#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {14143#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14139#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {14147#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14143#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {14151#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14147#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {14155#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14151#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {14159#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14155#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {14163#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14159#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {14167#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14163#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {14171#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14167#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {14175#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14171#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {14179#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14175#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {14183#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14179#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {14187#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14183#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {14191#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14187#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {14195#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14191#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {14199#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14195#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {14203#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14199#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {14207#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14203#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {14211#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14207#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {14215#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14211#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {14219#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14215#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {14223#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14219#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {14227#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14223#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {14231#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14227#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {14235#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14231#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {14239#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14235#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {14243#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14239#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {14247#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14243#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {13930#true} ~x~0 := 1;~y~0 := 0; {14247#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 02:58:44,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {13930#true} call #t~ret5 := main(); {13930#true} is VALID [2022-04-28 02:58:44,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13930#true} {13930#true} #34#return; {13930#true} is VALID [2022-04-28 02:58:44,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {13930#true} assume true; {13930#true} is VALID [2022-04-28 02:58:44,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {13930#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(12, 2);call #Ultimate.allocInit(12, 3); {13930#true} is VALID [2022-04-28 02:58:44,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {13930#true} call ULTIMATE.init(); {13930#true} is VALID [2022-04-28 02:58:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:44,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915565132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:44,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:44,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2022-04-28 02:58:44,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:44,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [365194247] [2022-04-28 02:58:44,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [365194247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:44,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:44,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 02:58:44,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238181130] [2022-04-28 02:58:44,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:44,435 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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 44 [2022-04-28 02:58:44,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:44,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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-28 02:58:44,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:44,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 02:58:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:44,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 02:58:44,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1365, Invalid=3747, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 02:58:44,459 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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-28 02:58:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:46,668 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 02:58:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 02:58:46,668 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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 44 [2022-04-28 02:58:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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-28 02:58:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-28 02:58:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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-28 02:58:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-28 02:58:46,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-28 02:58:46,727 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-28 02:58:46,728 INFO L225 Difference]: With dead ends: 51 [2022-04-28 02:58:46,728 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 02:58:46,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2723, Invalid=8407, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 02:58:46,729 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:46,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 58 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 02:58:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 02:58:46,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 02:58:46,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:46,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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-28 02:58:46,768 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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-28 02:58:46,768 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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-28 02:58:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:46,769 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 02:58:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 02:58:46,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:46,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:46,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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 46 states. [2022-04-28 02:58:46,769 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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 46 states. [2022-04-28 02:58:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:46,770 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 02:58:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 02:58:46,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:46,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:46,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:46,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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-28 02:58:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-28 02:58:46,771 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-28 02:58:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:46,771 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-28 02:58:46,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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-28 02:58:46,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-28 02:58:46,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 02:58:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 02:58:46,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:46,803 INFO L195 NwaCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:46,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:47,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67 [2022-04-28 02:58:47,003 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:47,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:47,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 67 times [2022-04-28 02:58:47,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:47,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2031558345] [2022-04-28 02:58:48,899 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:58:49,052 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:49,053 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash 83168567, now seen corresponding path program 1 times [2022-04-28 02:58:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:49,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577349485] [2022-04-28 02:58:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:49,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:49,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:58:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:49,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:58:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 68 times [2022-04-28 02:58:49,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:49,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763740520] [2022-04-28 02:58:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:49,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:49,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {14662#(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(12, 2);call #Ultimate.allocInit(12, 3); {14622#true} is VALID [2022-04-28 02:58:49,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {14622#true} assume true; {14622#true} is VALID [2022-04-28 02:58:49,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14622#true} {14622#true} #34#return; {14622#true} is VALID [2022-04-28 02:58:49,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {14622#true} call ULTIMATE.init(); {14662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:49,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {14662#(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(12, 2);call #Ultimate.allocInit(12, 3); {14622#true} is VALID [2022-04-28 02:58:49,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {14622#true} assume true; {14622#true} is VALID [2022-04-28 02:58:49,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14622#true} {14622#true} #34#return; {14622#true} is VALID [2022-04-28 02:58:49,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {14622#true} call #t~ret5 := main(); {14622#true} is VALID [2022-04-28 02:58:49,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {14622#true} ~x~0 := 1;~y~0 := 0; {14627#(= main_~y~0 0)} is VALID [2022-04-28 02:58:49,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {14627#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14628#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:49,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {14628#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14629#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:49,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {14629#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14630#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:49,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {14630#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14631#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:49,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {14631#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14632#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:49,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {14632#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14633#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:49,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {14633#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:49,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {14634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14635#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:49,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {14635#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14636#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:49,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {14636#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14637#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:49,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {14637#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14638#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:49,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {14638#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14639#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:49,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {14639#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14640#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:49,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {14640#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14641#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:49,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {14641#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14642#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:49,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {14642#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14643#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:49,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {14643#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14644#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:49,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {14644#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14645#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:49,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {14645#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14646#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:49,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {14646#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14647#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:49,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {14647#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14648#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:49,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {14648#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14649#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:49,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {14649#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14650#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:49,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {14650#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14651#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:49,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {14651#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14652#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:49,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {14652#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14653#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:49,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {14653#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14654#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:49,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {14654#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14655#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:49,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {14655#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14656#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:49,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {14656#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14657#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:58:49,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {14657#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14658#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:58:49,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {14658#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14659#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:58:49,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {14659#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14660#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:58:49,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {14660#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14661#(and (<= main_~y~0 34) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:58:49,819 INFO L290 TraceCheckUtils]: 40: Hoare triple {14661#(and (<= main_~y~0 34) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {14623#false} is VALID [2022-04-28 02:58:49,819 INFO L272 TraceCheckUtils]: 41: Hoare triple {14623#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {14623#false} is VALID [2022-04-28 02:58:49,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {14623#false} ~cond := #in~cond; {14623#false} is VALID [2022-04-28 02:58:49,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {14623#false} assume 0 == ~cond; {14623#false} is VALID [2022-04-28 02:58:49,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {14623#false} assume !false; {14623#false} is VALID [2022-04-28 02:58:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:49,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:49,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763740520] [2022-04-28 02:58:49,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763740520] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:49,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390416272] [2022-04-28 02:58:49,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:58:49,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:49,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:49,821 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:49,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 02:58:49,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:58:49,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:49,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-28 02:58:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:49,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:50,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {14622#true} call ULTIMATE.init(); {14622#true} is VALID [2022-04-28 02:58:50,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {14622#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(12, 2);call #Ultimate.allocInit(12, 3); {14622#true} is VALID [2022-04-28 02:58:50,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {14622#true} assume true; {14622#true} is VALID [2022-04-28 02:58:50,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14622#true} {14622#true} #34#return; {14622#true} is VALID [2022-04-28 02:58:50,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {14622#true} call #t~ret5 := main(); {14622#true} is VALID [2022-04-28 02:58:50,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {14622#true} ~x~0 := 1;~y~0 := 0; {14627#(= main_~y~0 0)} is VALID [2022-04-28 02:58:50,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {14627#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14628#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:50,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {14628#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14629#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:50,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {14629#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14630#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:50,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {14630#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14631#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:50,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {14631#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14632#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:50,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {14632#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14633#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:50,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {14633#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:50,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {14634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14635#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:50,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {14635#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14636#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:50,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {14636#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14637#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:50,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {14637#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14638#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:50,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {14638#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14639#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:50,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {14639#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14640#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:50,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {14640#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14641#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:50,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {14641#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14642#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:50,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {14642#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14643#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:50,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {14643#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14644#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:50,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {14644#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14645#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:50,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {14645#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14646#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:50,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {14646#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14647#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:50,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {14647#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14648#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:50,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {14648#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14649#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:50,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {14649#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14650#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:50,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {14650#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14651#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:50,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {14651#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14652#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:50,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {14652#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14653#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:50,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {14653#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14654#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:50,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {14654#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14655#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:50,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {14655#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14656#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:50,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {14656#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14657#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:58:50,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {14657#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14658#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:58:50,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {14658#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14659#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:58:50,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {14659#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14660#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:58:50,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {14660#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14783#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:58:50,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {14783#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {14623#false} is VALID [2022-04-28 02:58:50,298 INFO L272 TraceCheckUtils]: 41: Hoare triple {14623#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {14623#false} is VALID [2022-04-28 02:58:50,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {14623#false} ~cond := #in~cond; {14623#false} is VALID [2022-04-28 02:58:50,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {14623#false} assume 0 == ~cond; {14623#false} is VALID [2022-04-28 02:58:50,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {14623#false} assume !false; {14623#false} is VALID [2022-04-28 02:58:50,299 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:50,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:52,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {14623#false} assume !false; {14623#false} is VALID [2022-04-28 02:58:52,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {14623#false} assume 0 == ~cond; {14623#false} is VALID [2022-04-28 02:58:52,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {14623#false} ~cond := #in~cond; {14623#false} is VALID [2022-04-28 02:58:52,155 INFO L272 TraceCheckUtils]: 41: Hoare triple {14623#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {14623#false} is VALID [2022-04-28 02:58:52,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {14811#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {14623#false} is VALID [2022-04-28 02:58:52,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {14815#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14811#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:58:52,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {14819#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14815#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {14823#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14819#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {14827#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14823#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {14831#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14827#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {14835#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14831#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {14839#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14835#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {14843#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14839#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {14847#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14843#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {14851#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14847#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {14855#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14851#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {14859#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14855#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {14863#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14859#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {14867#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14863#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {14871#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14867#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {14875#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14871#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {14879#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14875#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {14883#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14879#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {14887#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14883#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {14891#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14887#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {14895#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14891#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {14899#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14895#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {14903#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14899#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {14907#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14903#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {14911#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14907#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {14915#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14911#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {14919#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14915#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {14923#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14919#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {14927#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14923#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {14931#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14927#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {14935#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14931#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {14939#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14935#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {14943#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14939#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {14947#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {14943#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {14622#true} ~x~0 := 1;~y~0 := 0; {14947#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 02:58:52,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {14622#true} call #t~ret5 := main(); {14622#true} is VALID [2022-04-28 02:58:52,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14622#true} {14622#true} #34#return; {14622#true} is VALID [2022-04-28 02:58:52,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {14622#true} assume true; {14622#true} is VALID [2022-04-28 02:58:52,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {14622#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(12, 2);call #Ultimate.allocInit(12, 3); {14622#true} is VALID [2022-04-28 02:58:52,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {14622#true} call ULTIMATE.init(); {14622#true} is VALID [2022-04-28 02:58:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:52,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390416272] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:52,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:52,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-28 02:58:52,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:52,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2031558345] [2022-04-28 02:58:52,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2031558345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:52,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:52,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 02:58:52,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598046431] [2022-04-28 02:58:52,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:52,200 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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 45 [2022-04-28 02:58:52,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:52,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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-28 02:58:52,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:52,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 02:58:52,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:52,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 02:58:52,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1440, Invalid=3962, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 02:58:52,224 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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-28 02:58:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:54,639 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 02:58:54,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 02:58:54,639 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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 45 [2022-04-28 02:58:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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-28 02:58:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-28 02:58:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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-28 02:58:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-28 02:58:54,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-28 02:58:54,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:54,679 INFO L225 Difference]: With dead ends: 52 [2022-04-28 02:58:54,679 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 02:58:54,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2873, Invalid=8899, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 02:58:54,680 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:54,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 02:58:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 02:58:54,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 02:58:54,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:54,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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-28 02:58:54,722 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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-28 02:58:54,722 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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-28 02:58:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:54,723 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 02:58:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 02:58:54,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:54,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:54,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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 47 states. [2022-04-28 02:58:54,723 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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 47 states. [2022-04-28 02:58:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:54,724 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 02:58:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 02:58:54,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:54,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:54,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:54,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 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-28 02:58:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-28 02:58:54,725 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-28 02:58:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:54,725 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-28 02:58:54,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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-28 02:58:54,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-28 02:58:54,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 02:58:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 02:58:54,761 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:54,761 INFO L195 NwaCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:54,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:54,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2022-04-28 02:58:54,961 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:54,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:54,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 69 times [2022-04-28 02:58:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:54,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [239911997] [2022-04-28 02:58:57,799 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:58:57,922 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:57,923 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:57,924 INFO L85 PathProgramCache]: Analyzing trace with hash 142273911, now seen corresponding path program 1 times [2022-04-28 02:58:57,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:57,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65112349] [2022-04-28 02:58:57,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:57,939 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:58:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:58:57,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:58:57,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 70 times [2022-04-28 02:58:57,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:57,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463928957] [2022-04-28 02:58:57,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:57,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:58,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:58,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {15371#(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(12, 2);call #Ultimate.allocInit(12, 3); {15330#true} is VALID [2022-04-28 02:58:58,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {15330#true} assume true; {15330#true} is VALID [2022-04-28 02:58:58,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15330#true} {15330#true} #34#return; {15330#true} is VALID [2022-04-28 02:58:58,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {15330#true} call ULTIMATE.init(); {15371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:58,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {15371#(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(12, 2);call #Ultimate.allocInit(12, 3); {15330#true} is VALID [2022-04-28 02:58:58,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {15330#true} assume true; {15330#true} is VALID [2022-04-28 02:58:58,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15330#true} {15330#true} #34#return; {15330#true} is VALID [2022-04-28 02:58:58,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {15330#true} call #t~ret5 := main(); {15330#true} is VALID [2022-04-28 02:58:58,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {15330#true} ~x~0 := 1;~y~0 := 0; {15335#(= main_~y~0 0)} is VALID [2022-04-28 02:58:58,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {15335#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15336#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:58,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {15336#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15337#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:58,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {15337#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15338#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:58,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {15338#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15339#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:58,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {15339#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15340#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:58,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {15340#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15341#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:58,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {15341#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15342#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:58,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {15342#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15343#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:58,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {15343#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15344#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:58,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {15344#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15345#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:58,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {15345#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15346#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:58,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {15346#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15347#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:58,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {15347#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15348#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:58,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {15348#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15349#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:58,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {15349#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15350#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:58,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {15350#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15351#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:58,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {15351#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15352#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:58,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {15352#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15353#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:58,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {15353#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15354#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:58,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {15354#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15355#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:58,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {15355#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15356#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:58,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {15356#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15357#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:58,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {15357#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15358#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:58,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {15358#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15359#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:58,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {15359#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15360#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:58,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {15360#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15361#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:58,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {15361#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15362#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:58,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {15362#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15363#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:58,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {15363#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15364#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:58,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {15364#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15365#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:58:58,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {15365#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15366#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:58:58,651 INFO L290 TraceCheckUtils]: 37: Hoare triple {15366#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15367#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:58:58,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {15367#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15368#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:58:58,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {15368#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15369#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:58:58,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {15369#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15370#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 35))} is VALID [2022-04-28 02:58:58,653 INFO L290 TraceCheckUtils]: 41: Hoare triple {15370#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 35))} assume !(~y~0 % 4294967296 < 1024); {15331#false} is VALID [2022-04-28 02:58:58,653 INFO L272 TraceCheckUtils]: 42: Hoare triple {15331#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {15331#false} is VALID [2022-04-28 02:58:58,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {15331#false} ~cond := #in~cond; {15331#false} is VALID [2022-04-28 02:58:58,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {15331#false} assume 0 == ~cond; {15331#false} is VALID [2022-04-28 02:58:58,653 INFO L290 TraceCheckUtils]: 45: Hoare triple {15331#false} assume !false; {15331#false} is VALID [2022-04-28 02:58:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:58,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:58,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463928957] [2022-04-28 02:58:58,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463928957] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:58,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364096146] [2022-04-28 02:58:58,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:58:58,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:58,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:58,655 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:58,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 02:58:58,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:58:58,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:58,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-28 02:58:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:58,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:59,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {15330#true} call ULTIMATE.init(); {15330#true} is VALID [2022-04-28 02:58:59,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {15330#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(12, 2);call #Ultimate.allocInit(12, 3); {15330#true} is VALID [2022-04-28 02:58:59,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {15330#true} assume true; {15330#true} is VALID [2022-04-28 02:58:59,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15330#true} {15330#true} #34#return; {15330#true} is VALID [2022-04-28 02:58:59,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {15330#true} call #t~ret5 := main(); {15330#true} is VALID [2022-04-28 02:58:59,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {15330#true} ~x~0 := 1;~y~0 := 0; {15335#(= main_~y~0 0)} is VALID [2022-04-28 02:58:59,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {15335#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15336#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:58:59,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {15336#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15337#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:58:59,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {15337#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15338#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:58:59,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {15338#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15339#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:58:59,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {15339#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15340#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:58:59,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {15340#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15341#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:58:59,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {15341#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15342#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:58:59,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {15342#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15343#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:58:59,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {15343#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15344#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:58:59,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {15344#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15345#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:58:59,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {15345#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15346#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:58:59,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {15346#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15347#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:58:59,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {15347#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15348#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:58:59,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {15348#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15349#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:58:59,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {15349#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15350#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:58:59,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {15350#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15351#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:58:59,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {15351#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15352#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:58:59,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {15352#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15353#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:58:59,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {15353#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15354#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:58:59,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {15354#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15355#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:58:59,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {15355#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15356#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:58:59,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {15356#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15357#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:58:59,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {15357#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15358#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:58:59,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {15358#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15359#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:58:59,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {15359#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15360#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:58:59,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {15360#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15361#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:58:59,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {15361#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15362#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:58:59,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {15362#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15363#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:58:59,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {15363#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15364#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:58:59,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {15364#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15365#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:58:59,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {15365#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15366#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:58:59,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {15366#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15367#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:58:59,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {15367#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15368#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:58:59,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {15368#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15369#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:58:59,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {15369#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15495#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 02:58:59,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {15495#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !(~y~0 % 4294967296 < 1024); {15331#false} is VALID [2022-04-28 02:58:59,201 INFO L272 TraceCheckUtils]: 42: Hoare triple {15331#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {15331#false} is VALID [2022-04-28 02:58:59,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {15331#false} ~cond := #in~cond; {15331#false} is VALID [2022-04-28 02:58:59,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {15331#false} assume 0 == ~cond; {15331#false} is VALID [2022-04-28 02:58:59,201 INFO L290 TraceCheckUtils]: 45: Hoare triple {15331#false} assume !false; {15331#false} is VALID [2022-04-28 02:58:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:59,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:01,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {15331#false} assume !false; {15331#false} is VALID [2022-04-28 02:59:01,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {15331#false} assume 0 == ~cond; {15331#false} is VALID [2022-04-28 02:59:01,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {15331#false} ~cond := #in~cond; {15331#false} is VALID [2022-04-28 02:59:01,110 INFO L272 TraceCheckUtils]: 42: Hoare triple {15331#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {15331#false} is VALID [2022-04-28 02:59:01,110 INFO L290 TraceCheckUtils]: 41: Hoare triple {15523#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {15331#false} is VALID [2022-04-28 02:59:01,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {15527#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15523#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:59:01,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {15531#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15527#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {15535#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15531#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,113 INFO L290 TraceCheckUtils]: 37: Hoare triple {15539#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15535#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {15543#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15539#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {15547#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15543#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {15551#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15547#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {15555#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15551#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {15559#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15555#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {15563#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15559#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {15567#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15563#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {15571#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15567#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {15575#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15571#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {15579#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15575#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {15583#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15579#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {15587#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15583#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {15591#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15587#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {15595#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15591#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {15599#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15595#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {15603#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15599#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {15607#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15603#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {15611#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15607#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {15615#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15611#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {15619#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15615#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {15623#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15619#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {15627#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15623#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {15631#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15627#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {15635#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15631#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {15639#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15635#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {15643#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15639#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {15647#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15643#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {15651#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15647#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {15655#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15651#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {15659#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15655#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {15663#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {15659#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {15330#true} ~x~0 := 1;~y~0 := 0; {15663#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:01,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {15330#true} call #t~ret5 := main(); {15330#true} is VALID [2022-04-28 02:59:01,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15330#true} {15330#true} #34#return; {15330#true} is VALID [2022-04-28 02:59:01,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {15330#true} assume true; {15330#true} is VALID [2022-04-28 02:59:01,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {15330#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(12, 2);call #Ultimate.allocInit(12, 3); {15330#true} is VALID [2022-04-28 02:59:01,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {15330#true} call ULTIMATE.init(); {15330#true} is VALID [2022-04-28 02:59:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:01,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364096146] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:01,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:01,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-28 02:59:01,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:01,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [239911997] [2022-04-28 02:59:01,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [239911997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:01,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:01,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 02:59:01,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653349937] [2022-04-28 02:59:01,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:01,133 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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 46 [2022-04-28 02:59:01,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:01,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-28 02:59:01,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:01,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 02:59:01,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:01,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 02:59:01,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1517, Invalid=4183, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 02:59:01,158 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-28 02:59:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:03,638 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 02:59:03,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 02:59:03,638 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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 46 [2022-04-28 02:59:03,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-28 02:59:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-28 02:59:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-28 02:59:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-28 02:59:03,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-28 02:59:03,682 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-28 02:59:03,684 INFO L225 Difference]: With dead ends: 53 [2022-04-28 02:59:03,684 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 02:59:03,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3027, Invalid=9405, Unknown=0, NotChecked=0, Total=12432 [2022-04-28 02:59:03,685 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:03,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 02:59:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 02:59:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 02:59:03,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:03,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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-28 02:59:03,733 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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-28 02:59:03,734 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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-28 02:59:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:03,734 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 02:59:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 02:59:03,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:03,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:03,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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 48 states. [2022-04-28 02:59:03,735 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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 48 states. [2022-04-28 02:59:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:03,735 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 02:59:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 02:59:03,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:03,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:03,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:03,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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-28 02:59:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-28 02:59:03,736 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-28 02:59:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:03,736 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-28 02:59:03,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-28 02:59:03,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-28 02:59:03,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 02:59:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 02:59:03,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:03,774 INFO L195 NwaCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:03,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:03,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:03,974 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:03,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:03,974 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 71 times [2022-04-28 02:59:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:03,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [237681525] [2022-04-28 02:59:07,000 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:59:07,119 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:59:07,120 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:59:07,122 INFO L85 PathProgramCache]: Analyzing trace with hash 201379255, now seen corresponding path program 1 times [2022-04-28 02:59:07,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:07,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219179547] [2022-04-28 02:59:07,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:07,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:59:07,127 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:59:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:59:07,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:59:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 72 times [2022-04-28 02:59:07,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:07,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409304438] [2022-04-28 02:59:07,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:07,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:07,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:07,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {16096#(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(12, 2);call #Ultimate.allocInit(12, 3); {16054#true} is VALID [2022-04-28 02:59:07,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {16054#true} assume true; {16054#true} is VALID [2022-04-28 02:59:07,914 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16054#true} {16054#true} #34#return; {16054#true} is VALID [2022-04-28 02:59:07,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {16054#true} call ULTIMATE.init(); {16096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:07,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {16096#(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(12, 2);call #Ultimate.allocInit(12, 3); {16054#true} is VALID [2022-04-28 02:59:07,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {16054#true} assume true; {16054#true} is VALID [2022-04-28 02:59:07,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16054#true} {16054#true} #34#return; {16054#true} is VALID [2022-04-28 02:59:07,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {16054#true} call #t~ret5 := main(); {16054#true} is VALID [2022-04-28 02:59:07,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {16054#true} ~x~0 := 1;~y~0 := 0; {16059#(= main_~y~0 0)} is VALID [2022-04-28 02:59:07,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {16059#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16060#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:59:07,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {16060#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16061#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:59:07,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {16061#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16062#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:59:07,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {16062#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16063#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:59:07,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {16063#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16064#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:59:07,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {16064#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16065#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:59:07,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {16065#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16066#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:59:07,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {16066#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16067#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:59:07,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {16067#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16068#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:59:07,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {16068#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16069#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:59:07,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {16069#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16070#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:59:07,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {16070#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16071#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:59:07,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {16071#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16072#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:59:07,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {16072#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16073#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:59:07,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {16073#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16074#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:59:07,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {16074#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16075#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:59:07,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {16075#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16076#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:59:07,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {16076#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16077#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:59:07,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {16077#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16078#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:59:07,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {16078#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16079#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:59:07,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {16079#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16080#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:59:07,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {16080#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16081#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:59:07,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {16081#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16082#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:59:07,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {16082#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16083#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:59:07,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {16083#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16084#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:59:07,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {16084#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16085#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:59:07,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {16085#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16086#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:59:07,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {16086#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16087#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:59:07,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {16087#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16088#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:59:07,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {16088#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16089#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:59:07,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {16089#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16090#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:59:07,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {16090#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16091#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:59:07,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {16091#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16092#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:59:07,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {16092#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16093#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:59:07,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {16093#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16094#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 02:59:07,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {16094#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16095#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 36))} is VALID [2022-04-28 02:59:07,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {16095#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 36))} assume !(~y~0 % 4294967296 < 1024); {16055#false} is VALID [2022-04-28 02:59:07,932 INFO L272 TraceCheckUtils]: 43: Hoare triple {16055#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {16055#false} is VALID [2022-04-28 02:59:07,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {16055#false} ~cond := #in~cond; {16055#false} is VALID [2022-04-28 02:59:07,932 INFO L290 TraceCheckUtils]: 45: Hoare triple {16055#false} assume 0 == ~cond; {16055#false} is VALID [2022-04-28 02:59:07,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {16055#false} assume !false; {16055#false} is VALID [2022-04-28 02:59:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:07,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:07,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409304438] [2022-04-28 02:59:07,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409304438] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:07,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120065852] [2022-04-28 02:59:07,933 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:59:07,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:07,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:07,934 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:07,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 02:59:10,836 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 02:59:10,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:10,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 81 conjunts are in the unsatisfiable core [2022-04-28 02:59:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:10,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:11,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {16054#true} call ULTIMATE.init(); {16054#true} is VALID [2022-04-28 02:59:11,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {16054#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(12, 2);call #Ultimate.allocInit(12, 3); {16054#true} is VALID [2022-04-28 02:59:11,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {16054#true} assume true; {16054#true} is VALID [2022-04-28 02:59:11,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16054#true} {16054#true} #34#return; {16054#true} is VALID [2022-04-28 02:59:11,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {16054#true} call #t~ret5 := main(); {16054#true} is VALID [2022-04-28 02:59:11,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {16054#true} ~x~0 := 1;~y~0 := 0; {16059#(= main_~y~0 0)} is VALID [2022-04-28 02:59:11,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {16059#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16060#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:59:11,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {16060#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16061#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:59:11,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {16061#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16062#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:59:11,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {16062#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16063#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:59:11,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {16063#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16064#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:59:11,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {16064#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16065#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:59:11,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {16065#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16066#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:59:11,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {16066#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16067#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:59:11,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {16067#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16068#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:59:11,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {16068#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16069#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:59:11,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {16069#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16070#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:59:11,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {16070#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16071#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:59:11,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {16071#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16072#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:59:11,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {16072#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16073#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:59:11,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {16073#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16074#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:59:11,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {16074#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16075#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:59:11,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {16075#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16076#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:59:11,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {16076#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16077#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:59:11,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {16077#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16078#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:59:11,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {16078#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16079#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:59:11,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {16079#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16080#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:59:11,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {16080#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16081#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:59:11,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {16081#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16082#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:59:11,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {16082#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16083#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:59:11,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {16083#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16084#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:59:11,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {16084#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16085#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:59:11,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {16085#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16086#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:59:11,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {16086#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16087#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:59:11,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {16087#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16088#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:59:11,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {16088#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16089#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:59:11,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {16089#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16090#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:59:11,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {16090#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16091#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:59:11,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {16091#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16092#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:59:11,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {16092#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16093#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:59:11,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {16093#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16094#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 02:59:11,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {16094#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16223#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 02:59:11,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {16223#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !(~y~0 % 4294967296 < 1024); {16055#false} is VALID [2022-04-28 02:59:11,321 INFO L272 TraceCheckUtils]: 43: Hoare triple {16055#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {16055#false} is VALID [2022-04-28 02:59:11,321 INFO L290 TraceCheckUtils]: 44: Hoare triple {16055#false} ~cond := #in~cond; {16055#false} is VALID [2022-04-28 02:59:11,321 INFO L290 TraceCheckUtils]: 45: Hoare triple {16055#false} assume 0 == ~cond; {16055#false} is VALID [2022-04-28 02:59:11,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {16055#false} assume !false; {16055#false} is VALID [2022-04-28 02:59:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:11,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:16,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {16055#false} assume !false; {16055#false} is VALID [2022-04-28 02:59:16,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {16055#false} assume 0 == ~cond; {16055#false} is VALID [2022-04-28 02:59:16,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {16055#false} ~cond := #in~cond; {16055#false} is VALID [2022-04-28 02:59:16,988 INFO L272 TraceCheckUtils]: 43: Hoare triple {16055#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {16055#false} is VALID [2022-04-28 02:59:16,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {16251#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {16055#false} is VALID [2022-04-28 02:59:16,990 INFO L290 TraceCheckUtils]: 41: Hoare triple {16255#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16251#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:59:16,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {16259#(or (< (mod (+ main_~y~0 2) 4294967296) 1024) (not (< (mod main_~y~0 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16255#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:59:16,991 INFO L290 TraceCheckUtils]: 39: Hoare triple {16263#(or (< (mod (+ main_~y~0 3) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16259#(or (< (mod (+ main_~y~0 2) 4294967296) 1024) (not (< (mod main_~y~0 4294967296) 1024)))} is VALID [2022-04-28 02:59:16,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {16267#(or (<= 1024 (mod (+ main_~y~0 2) 4294967296)) (< (mod (+ main_~y~0 4) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16263#(or (< (mod (+ main_~y~0 3) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 02:59:16,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {16271#(or (<= 1024 (mod (+ main_~y~0 3) 4294967296)) (< (mod (+ 5 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16267#(or (<= 1024 (mod (+ main_~y~0 2) 4294967296)) (< (mod (+ main_~y~0 4) 4294967296) 1024))} is VALID [2022-04-28 02:59:16,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {16275#(or (<= 1024 (mod (+ main_~y~0 4) 4294967296)) (< (mod (+ main_~y~0 6) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16271#(or (<= 1024 (mod (+ main_~y~0 3) 4294967296)) (< (mod (+ 5 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 02:59:16,994 INFO L290 TraceCheckUtils]: 35: Hoare triple {16279#(or (< (mod (+ 7 main_~y~0) 4294967296) 1024) (<= 1024 (mod (+ 5 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16275#(or (<= 1024 (mod (+ main_~y~0 4) 4294967296)) (< (mod (+ main_~y~0 6) 4294967296) 1024))} is VALID [2022-04-28 02:59:16,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {16283#(or (<= 1024 (mod (+ main_~y~0 6) 4294967296)) (< (mod (+ main_~y~0 8) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16279#(or (< (mod (+ 7 main_~y~0) 4294967296) 1024) (<= 1024 (mod (+ 5 main_~y~0) 4294967296)))} is VALID [2022-04-28 02:59:16,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {16287#(or (<= 1024 (mod (+ 7 main_~y~0) 4294967296)) (< (mod (+ main_~y~0 9) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16283#(or (<= 1024 (mod (+ main_~y~0 6) 4294967296)) (< (mod (+ main_~y~0 8) 4294967296) 1024))} is VALID [2022-04-28 02:59:16,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {16291#(or (< (mod (+ main_~y~0 10) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 8) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16287#(or (<= 1024 (mod (+ 7 main_~y~0) 4294967296)) (< (mod (+ main_~y~0 9) 4294967296) 1024))} is VALID [2022-04-28 02:59:16,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {16295#(or (<= 1024 (mod (+ main_~y~0 9) 4294967296)) (< (mod (+ main_~y~0 11) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16291#(or (< (mod (+ main_~y~0 10) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 8) 4294967296)))} is VALID [2022-04-28 02:59:16,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {16299#(or (<= 1024 (mod (+ main_~y~0 10) 4294967296)) (< (mod (+ main_~y~0 12) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16295#(or (<= 1024 (mod (+ main_~y~0 9) 4294967296)) (< (mod (+ main_~y~0 11) 4294967296) 1024))} is VALID [2022-04-28 02:59:16,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {16303#(or (< (mod (+ main_~y~0 13) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 11) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16299#(or (<= 1024 (mod (+ main_~y~0 10) 4294967296)) (< (mod (+ main_~y~0 12) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {16307#(or (< (mod (+ main_~y~0 14) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 12) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16303#(or (< (mod (+ main_~y~0 13) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 11) 4294967296)))} is VALID [2022-04-28 02:59:17,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {16311#(or (< (mod (+ main_~y~0 15) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 13) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16307#(or (< (mod (+ main_~y~0 14) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 12) 4294967296)))} is VALID [2022-04-28 02:59:17,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {16315#(or (< (mod (+ main_~y~0 16) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 14) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16311#(or (< (mod (+ main_~y~0 15) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 13) 4294967296)))} is VALID [2022-04-28 02:59:17,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {16319#(or (<= 1024 (mod (+ main_~y~0 15) 4294967296)) (< (mod (+ main_~y~0 17) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16315#(or (< (mod (+ main_~y~0 16) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 14) 4294967296)))} is VALID [2022-04-28 02:59:17,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {16323#(or (< (mod (+ main_~y~0 18) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 16) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16319#(or (<= 1024 (mod (+ main_~y~0 15) 4294967296)) (< (mod (+ main_~y~0 17) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {16327#(or (<= 1024 (mod (+ main_~y~0 17) 4294967296)) (< (mod (+ 19 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16323#(or (< (mod (+ main_~y~0 18) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 16) 4294967296)))} is VALID [2022-04-28 02:59:17,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {16331#(or (<= 1024 (mod (+ main_~y~0 18) 4294967296)) (< (mod (+ main_~y~0 20) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16327#(or (<= 1024 (mod (+ main_~y~0 17) 4294967296)) (< (mod (+ 19 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {16335#(or (< (mod (+ main_~y~0 21) 4294967296) 1024) (<= 1024 (mod (+ 19 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16331#(or (<= 1024 (mod (+ main_~y~0 18) 4294967296)) (< (mod (+ main_~y~0 20) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {16339#(or (<= 1024 (mod (+ main_~y~0 20) 4294967296)) (< (mod (+ main_~y~0 22) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16335#(or (< (mod (+ main_~y~0 21) 4294967296) 1024) (<= 1024 (mod (+ 19 main_~y~0) 4294967296)))} is VALID [2022-04-28 02:59:17,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {16343#(or (<= 1024 (mod (+ main_~y~0 21) 4294967296)) (< (mod (+ 23 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16339#(or (<= 1024 (mod (+ main_~y~0 20) 4294967296)) (< (mod (+ main_~y~0 22) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {16347#(or (<= 1024 (mod (+ main_~y~0 22) 4294967296)) (< (mod (+ main_~y~0 24) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16343#(or (<= 1024 (mod (+ main_~y~0 21) 4294967296)) (< (mod (+ 23 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {16351#(or (<= 1024 (mod (+ 23 main_~y~0) 4294967296)) (< (mod (+ main_~y~0 25) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16347#(or (<= 1024 (mod (+ main_~y~0 22) 4294967296)) (< (mod (+ main_~y~0 24) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {16355#(or (< (mod (+ main_~y~0 26) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 24) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16351#(or (<= 1024 (mod (+ 23 main_~y~0) 4294967296)) (< (mod (+ main_~y~0 25) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {16359#(or (< (mod (+ main_~y~0 27) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 25) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16355#(or (< (mod (+ main_~y~0 26) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 24) 4294967296)))} is VALID [2022-04-28 02:59:17,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {16363#(or (< (mod (+ main_~y~0 28) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 26) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16359#(or (< (mod (+ main_~y~0 27) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 25) 4294967296)))} is VALID [2022-04-28 02:59:17,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {16367#(or (<= 1024 (mod (+ main_~y~0 27) 4294967296)) (< (mod (+ 29 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16363#(or (< (mod (+ main_~y~0 28) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 26) 4294967296)))} is VALID [2022-04-28 02:59:17,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {16371#(or (<= 1024 (mod (+ main_~y~0 28) 4294967296)) (< (mod (+ 30 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16367#(or (<= 1024 (mod (+ main_~y~0 27) 4294967296)) (< (mod (+ 29 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {16375#(or (<= 1024 (mod (+ 29 main_~y~0) 4294967296)) (< (mod (+ main_~y~0 31) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16371#(or (<= 1024 (mod (+ main_~y~0 28) 4294967296)) (< (mod (+ 30 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {16379#(or (< (mod (+ 32 main_~y~0) 4294967296) 1024) (<= 1024 (mod (+ 30 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16375#(or (<= 1024 (mod (+ 29 main_~y~0) 4294967296)) (< (mod (+ main_~y~0 31) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {16383#(or (<= 1024 (mod (+ main_~y~0 31) 4294967296)) (< (mod (+ main_~y~0 33) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16379#(or (< (mod (+ 32 main_~y~0) 4294967296) 1024) (<= 1024 (mod (+ 30 main_~y~0) 4294967296)))} is VALID [2022-04-28 02:59:17,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {16387#(or (< (mod (+ main_~y~0 34) 4294967296) 1024) (<= 1024 (mod (+ 32 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16383#(or (<= 1024 (mod (+ main_~y~0 31) 4294967296)) (< (mod (+ main_~y~0 33) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {16391#(or (<= 1024 (mod (+ main_~y~0 33) 4294967296)) (< (mod (+ 35 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16387#(or (< (mod (+ main_~y~0 34) 4294967296) 1024) (<= 1024 (mod (+ 32 main_~y~0) 4294967296)))} is VALID [2022-04-28 02:59:17,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {16395#(or (< (mod (+ main_~y~0 36) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 34) 4294967296)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16391#(or (<= 1024 (mod (+ main_~y~0 33) 4294967296)) (< (mod (+ 35 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 02:59:17,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {16054#true} ~x~0 := 1;~y~0 := 0; {16395#(or (< (mod (+ main_~y~0 36) 4294967296) 1024) (<= 1024 (mod (+ main_~y~0 34) 4294967296)))} is VALID [2022-04-28 02:59:17,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {16054#true} call #t~ret5 := main(); {16054#true} is VALID [2022-04-28 02:59:17,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16054#true} {16054#true} #34#return; {16054#true} is VALID [2022-04-28 02:59:17,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {16054#true} assume true; {16054#true} is VALID [2022-04-28 02:59:17,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {16054#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(12, 2);call #Ultimate.allocInit(12, 3); {16054#true} is VALID [2022-04-28 02:59:17,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {16054#true} call ULTIMATE.init(); {16054#true} is VALID [2022-04-28 02:59:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:17,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120065852] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:17,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:17,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 78 [2022-04-28 02:59:17,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:17,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [237681525] [2022-04-28 02:59:17,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [237681525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:17,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:17,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 02:59:17,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895773504] [2022-04-28 02:59:17,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:17,019 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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 47 [2022-04-28 02:59:17,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:17,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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-28 02:59:17,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:17,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 02:59:17,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:17,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 02:59:17,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=4410, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 02:59:17,046 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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-28 02:59:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:19,887 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 02:59:19,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 02:59:19,887 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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 47 [2022-04-28 02:59:19,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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-28 02:59:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-28 02:59:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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-28 02:59:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-28 02:59:19,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-28 02:59:20,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:20,070 INFO L225 Difference]: With dead ends: 54 [2022-04-28 02:59:20,070 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 02:59:20,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=3185, Invalid=9925, Unknown=0, NotChecked=0, Total=13110 [2022-04-28 02:59:20,071 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:20,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 183 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 02:59:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 02:59:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 02:59:20,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:20,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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-28 02:59:20,117 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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-28 02:59:20,117 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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-28 02:59:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:20,118 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 02:59:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 02:59:20,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:20,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:20,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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 49 states. [2022-04-28 02:59:20,118 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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 49 states. [2022-04-28 02:59:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:20,119 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 02:59:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 02:59:20,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:20,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:20,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:20,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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-28 02:59:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-28 02:59:20,120 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-28 02:59:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:20,120 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-28 02:59:20,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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-28 02:59:20,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-28 02:59:20,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 02:59:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 02:59:20,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:20,155 INFO L195 NwaCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:20,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:20,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:20,356 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 73 times [2022-04-28 02:59:20,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:20,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2068191355] [2022-04-28 02:59:20,629 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:59:20,632 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:59:20,633 INFO L85 PathProgramCache]: Analyzing trace with hash 260484599, now seen corresponding path program 1 times [2022-04-28 02:59:20,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:20,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613039680] [2022-04-28 02:59:20,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:20,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:59:20,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:59:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:59:20,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:59:20,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 74 times [2022-04-28 02:59:20,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:20,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056829707] [2022-04-28 02:59:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:21,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {16837#(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(12, 2);call #Ultimate.allocInit(12, 3); {16794#true} is VALID [2022-04-28 02:59:21,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {16794#true} assume true; {16794#true} is VALID [2022-04-28 02:59:21,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16794#true} {16794#true} #34#return; {16794#true} is VALID [2022-04-28 02:59:21,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {16794#true} call ULTIMATE.init(); {16837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:21,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {16837#(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(12, 2);call #Ultimate.allocInit(12, 3); {16794#true} is VALID [2022-04-28 02:59:21,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {16794#true} assume true; {16794#true} is VALID [2022-04-28 02:59:21,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16794#true} {16794#true} #34#return; {16794#true} is VALID [2022-04-28 02:59:21,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {16794#true} call #t~ret5 := main(); {16794#true} is VALID [2022-04-28 02:59:21,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {16794#true} ~x~0 := 1;~y~0 := 0; {16799#(= main_~y~0 0)} is VALID [2022-04-28 02:59:21,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {16799#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16800#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:59:21,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {16800#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16801#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:59:21,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {16801#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16802#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:59:21,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {16802#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16803#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:59:21,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {16803#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16804#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:59:21,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {16804#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16805#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:59:21,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {16805#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16806#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:59:21,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {16806#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16807#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:59:21,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {16807#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16808#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:59:21,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {16808#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16809#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:59:21,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {16809#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16810#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:59:21,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {16810#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16811#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:59:21,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {16811#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16812#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:59:21,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {16812#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16813#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:59:21,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {16813#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16814#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:59:21,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {16814#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16815#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:59:21,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {16815#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16816#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:59:21,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {16816#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16817#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:59:21,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {16817#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16818#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:59:21,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {16818#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16819#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:59:21,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {16819#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16820#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:59:21,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {16820#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16821#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:59:21,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {16821#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16822#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:59:21,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {16822#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16823#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:59:21,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {16823#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16824#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:59:21,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {16824#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16825#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:59:21,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {16825#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16826#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:59:21,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {16826#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16827#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:59:21,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {16827#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16828#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:59:21,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {16828#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16829#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:59:21,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {16829#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16830#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:59:21,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {16830#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16831#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:59:21,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {16831#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16832#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:59:21,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {16832#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16833#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:59:21,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {16833#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16834#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 02:59:21,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {16834#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16835#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 02:59:21,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {16835#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16836#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 37))} is VALID [2022-04-28 02:59:21,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {16836#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 37))} assume !(~y~0 % 4294967296 < 1024); {16795#false} is VALID [2022-04-28 02:59:21,452 INFO L272 TraceCheckUtils]: 44: Hoare triple {16795#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {16795#false} is VALID [2022-04-28 02:59:21,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {16795#false} ~cond := #in~cond; {16795#false} is VALID [2022-04-28 02:59:21,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {16795#false} assume 0 == ~cond; {16795#false} is VALID [2022-04-28 02:59:21,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {16795#false} assume !false; {16795#false} is VALID [2022-04-28 02:59:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:21,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:21,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056829707] [2022-04-28 02:59:21,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056829707] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:21,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137605898] [2022-04-28 02:59:21,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:59:21,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:21,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:21,454 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:21,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 02:59:21,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:59:21,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:21,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 77 conjunts are in the unsatisfiable core [2022-04-28 02:59:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:21,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:21,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {16794#true} call ULTIMATE.init(); {16794#true} is VALID [2022-04-28 02:59:21,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {16794#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(12, 2);call #Ultimate.allocInit(12, 3); {16794#true} is VALID [2022-04-28 02:59:21,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {16794#true} assume true; {16794#true} is VALID [2022-04-28 02:59:21,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16794#true} {16794#true} #34#return; {16794#true} is VALID [2022-04-28 02:59:21,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {16794#true} call #t~ret5 := main(); {16794#true} is VALID [2022-04-28 02:59:21,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {16794#true} ~x~0 := 1;~y~0 := 0; {16799#(= main_~y~0 0)} is VALID [2022-04-28 02:59:21,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {16799#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16800#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:59:21,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {16800#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16801#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:59:21,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {16801#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16802#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:59:21,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {16802#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16803#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:59:21,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {16803#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16804#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:59:21,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {16804#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16805#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:59:21,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {16805#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16806#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:59:21,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {16806#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16807#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:59:21,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {16807#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16808#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:59:21,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {16808#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16809#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:59:21,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {16809#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16810#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:59:21,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {16810#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16811#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:59:21,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {16811#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16812#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:59:21,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {16812#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16813#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:59:21,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {16813#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16814#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:59:21,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {16814#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16815#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:59:21,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {16815#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16816#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:59:21,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {16816#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16817#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:59:21,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {16817#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16818#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:59:21,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {16818#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16819#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:59:21,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {16819#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16820#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:59:21,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {16820#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16821#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:59:21,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {16821#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16822#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:59:21,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {16822#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16823#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:59:21,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {16823#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16824#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:59:21,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {16824#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16825#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:59:21,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {16825#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16826#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:59:21,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {16826#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16827#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:59:21,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {16827#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16828#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:59:21,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {16828#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16829#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:59:21,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {16829#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16830#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:59:21,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {16830#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16831#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:59:21,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {16831#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16832#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:59:21,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {16832#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16833#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:59:21,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {16833#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16834#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 02:59:21,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {16834#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16835#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 02:59:21,978 INFO L290 TraceCheckUtils]: 42: Hoare triple {16835#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16967#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 02:59:21,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {16967#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {16795#false} is VALID [2022-04-28 02:59:21,978 INFO L272 TraceCheckUtils]: 44: Hoare triple {16795#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {16795#false} is VALID [2022-04-28 02:59:21,978 INFO L290 TraceCheckUtils]: 45: Hoare triple {16795#false} ~cond := #in~cond; {16795#false} is VALID [2022-04-28 02:59:21,978 INFO L290 TraceCheckUtils]: 46: Hoare triple {16795#false} assume 0 == ~cond; {16795#false} is VALID [2022-04-28 02:59:21,978 INFO L290 TraceCheckUtils]: 47: Hoare triple {16795#false} assume !false; {16795#false} is VALID [2022-04-28 02:59:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:21,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:24,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {16795#false} assume !false; {16795#false} is VALID [2022-04-28 02:59:24,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {16795#false} assume 0 == ~cond; {16795#false} is VALID [2022-04-28 02:59:24,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {16795#false} ~cond := #in~cond; {16795#false} is VALID [2022-04-28 02:59:24,128 INFO L272 TraceCheckUtils]: 44: Hoare triple {16795#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {16795#false} is VALID [2022-04-28 02:59:24,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {16995#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {16795#false} is VALID [2022-04-28 02:59:24,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {16999#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16995#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:59:24,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {17003#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {16999#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {17007#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17003#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {17011#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17007#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {17015#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17011#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,132 INFO L290 TraceCheckUtils]: 37: Hoare triple {17019#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17015#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {17023#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17019#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {17027#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17023#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {17031#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17027#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {17035#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17031#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {17039#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17035#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {17043#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17039#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {17047#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17043#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {17051#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17047#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {17055#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17051#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {17059#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17055#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {17063#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17059#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {17067#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17063#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {17071#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17067#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {17075#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17071#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {17079#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17075#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {17083#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17079#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {17087#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17083#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {17091#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17087#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {17095#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17091#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {17099#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17095#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {17103#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17099#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {17107#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17103#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {17111#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17107#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {17115#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17111#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {17119#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17115#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {17123#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17119#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {17127#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17123#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {17131#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17127#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {17135#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17131#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {17139#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17135#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {17143#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17139#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {16794#true} ~x~0 := 1;~y~0 := 0; {17143#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 02:59:24,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {16794#true} call #t~ret5 := main(); {16794#true} is VALID [2022-04-28 02:59:24,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16794#true} {16794#true} #34#return; {16794#true} is VALID [2022-04-28 02:59:24,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {16794#true} assume true; {16794#true} is VALID [2022-04-28 02:59:24,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {16794#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(12, 2);call #Ultimate.allocInit(12, 3); {16794#true} is VALID [2022-04-28 02:59:24,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {16794#true} call ULTIMATE.init(); {16794#true} is VALID [2022-04-28 02:59:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:24,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137605898] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:24,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:24,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-28 02:59:24,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:24,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2068191355] [2022-04-28 02:59:24,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2068191355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:24,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:24,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 02:59:24,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981229663] [2022-04-28 02:59:24,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:24,158 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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 48 [2022-04-28 02:59:24,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:24,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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-28 02:59:24,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:24,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 02:59:24,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:24,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 02:59:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1677, Invalid=4643, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 02:59:24,184 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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-28 02:59:27,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:27,089 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 02:59:27,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 02:59:27,089 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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 48 [2022-04-28 02:59:27,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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-28 02:59:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-28 02:59:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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-28 02:59:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-28 02:59:27,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-28 02:59:27,134 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-28 02:59:27,135 INFO L225 Difference]: With dead ends: 55 [2022-04-28 02:59:27,135 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 02:59:27,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3347, Invalid=10459, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 02:59:27,136 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:27,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 02:59:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 02:59:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 02:59:27,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:27,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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-28 02:59:27,185 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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-28 02:59:27,185 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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-28 02:59:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:27,186 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 02:59:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 02:59:27,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:27,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:27,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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 50 states. [2022-04-28 02:59:27,186 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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 50 states. [2022-04-28 02:59:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:27,187 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 02:59:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 02:59:27,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:27,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:27,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:27,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 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-28 02:59:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-28 02:59:27,189 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-28 02:59:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:27,189 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-28 02:59:27,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 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-28 02:59:27,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-28 02:59:27,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 02:59:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 02:59:27,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:27,227 INFO L195 NwaCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:27,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:27,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:27,460 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 75 times [2022-04-28 02:59:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:27,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383814265] [2022-04-28 02:59:31,484 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:59:31,598 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:59:31,599 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:59:31,601 INFO L85 PathProgramCache]: Analyzing trace with hash 319589943, now seen corresponding path program 1 times [2022-04-28 02:59:31,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:31,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356558373] [2022-04-28 02:59:31,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:31,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:59:31,605 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:59:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:59:31,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:59:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 76 times [2022-04-28 02:59:31,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:31,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104047872] [2022-04-28 02:59:31,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:31,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:32,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:32,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {17594#(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(12, 2);call #Ultimate.allocInit(12, 3); {17550#true} is VALID [2022-04-28 02:59:32,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {17550#true} assume true; {17550#true} is VALID [2022-04-28 02:59:32,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17550#true} {17550#true} #34#return; {17550#true} is VALID [2022-04-28 02:59:32,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {17550#true} call ULTIMATE.init(); {17594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:32,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {17594#(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(12, 2);call #Ultimate.allocInit(12, 3); {17550#true} is VALID [2022-04-28 02:59:32,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {17550#true} assume true; {17550#true} is VALID [2022-04-28 02:59:32,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17550#true} {17550#true} #34#return; {17550#true} is VALID [2022-04-28 02:59:32,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {17550#true} call #t~ret5 := main(); {17550#true} is VALID [2022-04-28 02:59:32,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {17550#true} ~x~0 := 1;~y~0 := 0; {17555#(= main_~y~0 0)} is VALID [2022-04-28 02:59:32,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {17555#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:59:32,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {17556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:59:32,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {17557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:59:32,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {17558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17559#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:59:32,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {17559#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17560#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:59:32,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {17560#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17561#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:59:32,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {17561#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17562#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:59:32,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {17562#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17563#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:59:32,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {17563#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17564#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:59:32,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {17564#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17565#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:59:32,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {17565#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17566#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:59:32,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {17566#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17567#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:59:32,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {17567#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17568#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:59:32,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {17568#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17569#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:59:32,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {17569#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17570#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:59:32,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {17570#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17571#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:59:32,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {17571#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17572#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:59:32,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {17572#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17573#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:59:32,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {17573#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17574#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:59:32,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {17574#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17575#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:59:32,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {17575#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17576#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:59:32,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {17576#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17577#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:59:32,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {17577#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17578#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:59:32,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {17578#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17579#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:59:32,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {17579#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17580#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:59:32,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {17580#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17581#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:59:32,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {17581#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17582#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:59:32,477 INFO L290 TraceCheckUtils]: 33: Hoare triple {17582#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17583#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:59:32,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {17583#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17584#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:59:32,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {17584#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17585#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:59:32,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {17585#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17586#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:59:32,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {17586#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17587#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:59:32,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {17587#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17588#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:59:32,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {17588#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17589#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:59:32,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {17589#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17590#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 02:59:32,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {17590#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17591#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 02:59:32,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {17591#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17592#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 02:59:32,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {17592#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17593#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 38))} is VALID [2022-04-28 02:59:32,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {17593#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 38))} assume !(~y~0 % 4294967296 < 1024); {17551#false} is VALID [2022-04-28 02:59:32,495 INFO L272 TraceCheckUtils]: 45: Hoare triple {17551#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {17551#false} is VALID [2022-04-28 02:59:32,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {17551#false} ~cond := #in~cond; {17551#false} is VALID [2022-04-28 02:59:32,495 INFO L290 TraceCheckUtils]: 47: Hoare triple {17551#false} assume 0 == ~cond; {17551#false} is VALID [2022-04-28 02:59:32,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {17551#false} assume !false; {17551#false} is VALID [2022-04-28 02:59:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:32,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:32,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104047872] [2022-04-28 02:59:32,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104047872] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:32,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553038303] [2022-04-28 02:59:32,496 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:59:32,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:32,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:32,497 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:32,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 02:59:32,600 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:59:32,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:32,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-28 02:59:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:32,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:33,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {17550#true} call ULTIMATE.init(); {17550#true} is VALID [2022-04-28 02:59:33,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {17550#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(12, 2);call #Ultimate.allocInit(12, 3); {17550#true} is VALID [2022-04-28 02:59:33,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {17550#true} assume true; {17550#true} is VALID [2022-04-28 02:59:33,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17550#true} {17550#true} #34#return; {17550#true} is VALID [2022-04-28 02:59:33,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {17550#true} call #t~ret5 := main(); {17550#true} is VALID [2022-04-28 02:59:33,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {17550#true} ~x~0 := 1;~y~0 := 0; {17555#(= main_~y~0 0)} is VALID [2022-04-28 02:59:33,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {17555#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:59:33,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {17556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:59:33,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {17557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:59:33,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {17558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17559#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:59:33,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {17559#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17560#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:59:33,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {17560#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17561#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:59:33,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {17561#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17562#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:59:33,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {17562#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17563#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:59:33,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {17563#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17564#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:59:33,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {17564#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17565#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:59:33,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {17565#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17566#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:59:33,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {17566#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17567#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:59:33,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {17567#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17568#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:59:33,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {17568#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17569#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:59:33,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {17569#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17570#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:59:33,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {17570#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17571#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:59:33,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {17571#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17572#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:59:33,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {17572#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17573#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:59:33,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {17573#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17574#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:59:33,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {17574#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17575#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:59:33,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {17575#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17576#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:59:33,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {17576#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17577#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:59:33,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {17577#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17578#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:59:33,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {17578#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17579#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:59:33,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {17579#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17580#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:59:33,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {17580#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17581#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:59:33,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {17581#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17582#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:59:33,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {17582#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17583#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:59:33,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {17583#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17584#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:59:33,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {17584#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17585#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:59:33,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {17585#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17586#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:59:33,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {17586#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17587#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:59:33,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {17587#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17588#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:59:33,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {17588#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17589#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:59:33,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {17589#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17590#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 02:59:33,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {17590#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17591#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 02:59:33,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {17591#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17592#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 02:59:33,043 INFO L290 TraceCheckUtils]: 43: Hoare triple {17592#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17727#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 02:59:33,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {17727#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !(~y~0 % 4294967296 < 1024); {17551#false} is VALID [2022-04-28 02:59:33,043 INFO L272 TraceCheckUtils]: 45: Hoare triple {17551#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {17551#false} is VALID [2022-04-28 02:59:33,043 INFO L290 TraceCheckUtils]: 46: Hoare triple {17551#false} ~cond := #in~cond; {17551#false} is VALID [2022-04-28 02:59:33,043 INFO L290 TraceCheckUtils]: 47: Hoare triple {17551#false} assume 0 == ~cond; {17551#false} is VALID [2022-04-28 02:59:33,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {17551#false} assume !false; {17551#false} is VALID [2022-04-28 02:59:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:33,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:35,268 INFO L290 TraceCheckUtils]: 48: Hoare triple {17551#false} assume !false; {17551#false} is VALID [2022-04-28 02:59:35,268 INFO L290 TraceCheckUtils]: 47: Hoare triple {17551#false} assume 0 == ~cond; {17551#false} is VALID [2022-04-28 02:59:35,268 INFO L290 TraceCheckUtils]: 46: Hoare triple {17551#false} ~cond := #in~cond; {17551#false} is VALID [2022-04-28 02:59:35,268 INFO L272 TraceCheckUtils]: 45: Hoare triple {17551#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {17551#false} is VALID [2022-04-28 02:59:35,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {17755#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {17551#false} is VALID [2022-04-28 02:59:35,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {17759#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17755#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:59:35,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {17763#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17759#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {17767#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17763#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {17771#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17767#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {17775#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17771#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {17779#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17775#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {17783#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17779#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {17787#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17783#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {17791#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17787#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {17795#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17791#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {17799#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17795#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {17803#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17799#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {17807#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17803#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {17811#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17807#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {17815#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17811#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {17819#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17815#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {17823#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17819#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {17827#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17823#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {17831#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17827#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {17835#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17831#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {17839#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17835#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {17843#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17839#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {17847#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17843#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {17851#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17847#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {17855#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17851#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {17859#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17855#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {17863#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17859#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {17867#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17863#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {17871#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17867#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {17875#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17871#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {17879#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17875#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {17883#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17879#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {17887#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17883#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {17891#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17887#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {17895#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17891#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {17899#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17895#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {17903#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17899#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {17907#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {17903#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {17550#true} ~x~0 := 1;~y~0 := 0; {17907#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 02:59:35,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {17550#true} call #t~ret5 := main(); {17550#true} is VALID [2022-04-28 02:59:35,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17550#true} {17550#true} #34#return; {17550#true} is VALID [2022-04-28 02:59:35,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {17550#true} assume true; {17550#true} is VALID [2022-04-28 02:59:35,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {17550#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(12, 2);call #Ultimate.allocInit(12, 3); {17550#true} is VALID [2022-04-28 02:59:35,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {17550#true} call ULTIMATE.init(); {17550#true} is VALID [2022-04-28 02:59:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:35,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553038303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:35,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:35,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2022-04-28 02:59:35,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:35,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383814265] [2022-04-28 02:59:35,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383814265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:35,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:35,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 02:59:35,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537199139] [2022-04-28 02:59:35,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:35,302 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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 49 [2022-04-28 02:59:35,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:35,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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-28 02:59:35,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:35,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 02:59:35,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:35,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 02:59:35,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1760, Invalid=4882, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 02:59:35,328 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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-28 02:59:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:38,321 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 02:59:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 02:59:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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 49 [2022-04-28 02:59:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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-28 02:59:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-28 02:59:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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-28 02:59:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-28 02:59:38,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-28 02:59:38,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:38,355 INFO L225 Difference]: With dead ends: 56 [2022-04-28 02:59:38,355 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 02:59:38,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3513, Invalid=11007, Unknown=0, NotChecked=0, Total=14520 [2022-04-28 02:59:38,356 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:38,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 02:59:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 02:59:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 02:59:38,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:38,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 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-28 02:59:38,403 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 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-28 02:59:38,403 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 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-28 02:59:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:38,404 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 02:59:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 02:59:38,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:38,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:38,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 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 51 states. [2022-04-28 02:59:38,404 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 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 51 states. [2022-04-28 02:59:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:38,405 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 02:59:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 02:59:38,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:38,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:38,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:38,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 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-28 02:59:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-28 02:59:38,406 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-28 02:59:38,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:38,406 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-28 02:59:38,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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-28 02:59:38,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-28 02:59:38,451 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-28 02:59:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 02:59:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 02:59:38,451 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:38,451 INFO L195 NwaCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:38,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:38,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77 [2022-04-28 02:59:38,652 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 77 times [2022-04-28 02:59:38,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:38,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1386341688] [2022-04-28 02:59:42,990 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:59:43,125 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:59:43,127 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:59:43,128 INFO L85 PathProgramCache]: Analyzing trace with hash 378695287, now seen corresponding path program 1 times [2022-04-28 02:59:43,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:43,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240416263] [2022-04-28 02:59:43,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:59:43,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:59:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:59:43,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:59:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 78 times [2022-04-28 02:59:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:43,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758257683] [2022-04-28 02:59:43,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:44,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:44,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {18367#(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(12, 2);call #Ultimate.allocInit(12, 3); {18322#true} is VALID [2022-04-28 02:59:44,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {18322#true} assume true; {18322#true} is VALID [2022-04-28 02:59:44,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18322#true} {18322#true} #34#return; {18322#true} is VALID [2022-04-28 02:59:44,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {18322#true} call ULTIMATE.init(); {18367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:44,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {18367#(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(12, 2);call #Ultimate.allocInit(12, 3); {18322#true} is VALID [2022-04-28 02:59:44,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {18322#true} assume true; {18322#true} is VALID [2022-04-28 02:59:44,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18322#true} {18322#true} #34#return; {18322#true} is VALID [2022-04-28 02:59:44,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {18322#true} call #t~ret5 := main(); {18322#true} is VALID [2022-04-28 02:59:44,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {18322#true} ~x~0 := 1;~y~0 := 0; {18327#(= main_~y~0 0)} is VALID [2022-04-28 02:59:44,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {18327#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:59:44,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {18328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:59:44,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {18329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:59:44,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {18330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:59:44,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {18331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:59:44,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {18332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:59:44,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {18333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:59:44,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {18334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:59:44,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {18335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:59:44,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {18336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:59:44,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {18337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:59:44,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {18338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:59:44,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {18339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18340#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:59:44,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {18340#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18341#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:59:44,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {18341#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18342#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:59:44,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {18342#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18343#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:59:44,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {18343#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18344#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:59:44,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {18344#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18345#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:59:44,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {18345#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18346#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:59:44,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {18346#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18347#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:59:44,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {18347#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18348#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:59:44,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {18348#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18349#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:59:44,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {18349#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18350#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:59:44,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {18350#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18351#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:59:44,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {18351#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18352#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:59:44,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {18352#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18353#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:59:44,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {18353#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18354#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:59:44,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {18354#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18355#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:59:44,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {18355#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18356#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:59:44,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {18356#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18357#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:59:44,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {18357#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18358#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:59:44,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {18358#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18359#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:59:44,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {18359#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18360#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:59:44,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {18360#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18361#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:59:44,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {18361#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18362#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 02:59:44,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {18362#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18363#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 02:59:44,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {18363#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18364#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 02:59:44,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {18364#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18365#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 02:59:44,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {18365#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18366#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 39))} is VALID [2022-04-28 02:59:44,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {18366#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 39))} assume !(~y~0 % 4294967296 < 1024); {18323#false} is VALID [2022-04-28 02:59:44,068 INFO L272 TraceCheckUtils]: 46: Hoare triple {18323#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {18323#false} is VALID [2022-04-28 02:59:44,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {18323#false} ~cond := #in~cond; {18323#false} is VALID [2022-04-28 02:59:44,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {18323#false} assume 0 == ~cond; {18323#false} is VALID [2022-04-28 02:59:44,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {18323#false} assume !false; {18323#false} is VALID [2022-04-28 02:59:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:44,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758257683] [2022-04-28 02:59:44,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758257683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:44,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625222502] [2022-04-28 02:59:44,069 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:59:44,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:44,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:44,070 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:44,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 02:59:46,370 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-04-28 02:59:46,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:46,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 81 conjunts are in the unsatisfiable core [2022-04-28 02:59:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:46,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:46,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {18322#true} call ULTIMATE.init(); {18322#true} is VALID [2022-04-28 02:59:46,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {18322#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(12, 2);call #Ultimate.allocInit(12, 3); {18322#true} is VALID [2022-04-28 02:59:46,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {18322#true} assume true; {18322#true} is VALID [2022-04-28 02:59:46,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18322#true} {18322#true} #34#return; {18322#true} is VALID [2022-04-28 02:59:46,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {18322#true} call #t~ret5 := main(); {18322#true} is VALID [2022-04-28 02:59:46,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {18322#true} ~x~0 := 1;~y~0 := 0; {18327#(= main_~y~0 0)} is VALID [2022-04-28 02:59:46,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {18327#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:59:46,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {18328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:59:46,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {18329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:59:46,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {18330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:59:46,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {18331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:59:46,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {18332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:59:46,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {18333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:59:46,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {18334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:59:46,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {18335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:59:46,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {18336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:59:46,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {18337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:59:46,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {18338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:59:46,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {18339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18340#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:59:46,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {18340#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18341#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:59:46,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {18341#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18342#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:59:46,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {18342#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18343#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:59:46,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {18343#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18344#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:59:46,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {18344#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18345#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:59:46,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {18345#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18346#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:59:46,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {18346#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18347#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:59:46,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {18347#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18348#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:59:46,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {18348#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18349#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:59:46,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {18349#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18350#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:59:46,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {18350#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18351#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:59:46,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {18351#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18352#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:59:46,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {18352#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18353#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:59:46,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {18353#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18354#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:59:46,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {18354#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18355#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:59:46,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {18355#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18356#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:59:46,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {18356#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18357#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:59:46,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {18357#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18358#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:59:46,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {18358#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18359#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:59:46,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {18359#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18360#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:59:46,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {18360#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18361#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:59:46,833 INFO L290 TraceCheckUtils]: 40: Hoare triple {18361#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18362#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 02:59:46,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {18362#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18363#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 02:59:46,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {18363#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18364#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 02:59:46,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {18364#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18365#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 02:59:46,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {18365#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18503#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 02:59:46,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {18503#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !(~y~0 % 4294967296 < 1024); {18323#false} is VALID [2022-04-28 02:59:46,835 INFO L272 TraceCheckUtils]: 46: Hoare triple {18323#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {18323#false} is VALID [2022-04-28 02:59:46,835 INFO L290 TraceCheckUtils]: 47: Hoare triple {18323#false} ~cond := #in~cond; {18323#false} is VALID [2022-04-28 02:59:46,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {18323#false} assume 0 == ~cond; {18323#false} is VALID [2022-04-28 02:59:46,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {18323#false} assume !false; {18323#false} is VALID [2022-04-28 02:59:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:46,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:49,159 INFO L290 TraceCheckUtils]: 49: Hoare triple {18323#false} assume !false; {18323#false} is VALID [2022-04-28 02:59:49,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {18323#false} assume 0 == ~cond; {18323#false} is VALID [2022-04-28 02:59:49,160 INFO L290 TraceCheckUtils]: 47: Hoare triple {18323#false} ~cond := #in~cond; {18323#false} is VALID [2022-04-28 02:59:49,160 INFO L272 TraceCheckUtils]: 46: Hoare triple {18323#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {18323#false} is VALID [2022-04-28 02:59:49,160 INFO L290 TraceCheckUtils]: 45: Hoare triple {18531#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {18323#false} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {18535#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18531#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {18539#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18535#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {18543#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18539#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 41: Hoare triple {18547#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18543#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 40: Hoare triple {18551#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18547#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {18555#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18551#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {18559#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18555#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {18563#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18559#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {18567#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18563#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {18571#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18567#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {18575#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18571#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {18579#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18575#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {18583#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18579#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {18587#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18583#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {18591#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18587#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {18595#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18591#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {18599#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18595#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {18603#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18599#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {18607#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18603#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {18611#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18607#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {18615#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18611#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {18619#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18615#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {18623#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18619#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {18627#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18623#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {18631#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18627#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {18635#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18631#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {18639#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18635#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {18643#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18639#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {18647#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18643#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {18651#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18647#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {18655#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18651#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {18659#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18655#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {18663#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18659#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {18667#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18663#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {18671#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18667#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {18675#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18671#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {18679#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18675#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {18683#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18679#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {18687#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {18683#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {18322#true} ~x~0 := 1;~y~0 := 0; {18687#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 02:59:49,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {18322#true} call #t~ret5 := main(); {18322#true} is VALID [2022-04-28 02:59:49,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18322#true} {18322#true} #34#return; {18322#true} is VALID [2022-04-28 02:59:49,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {18322#true} assume true; {18322#true} is VALID [2022-04-28 02:59:49,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {18322#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(12, 2);call #Ultimate.allocInit(12, 3); {18322#true} is VALID [2022-04-28 02:59:49,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {18322#true} call ULTIMATE.init(); {18322#true} is VALID [2022-04-28 02:59:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:49,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625222502] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:49,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:49,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 84 [2022-04-28 02:59:49,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:49,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1386341688] [2022-04-28 02:59:49,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1386341688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:49,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:49,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 02:59:49,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724716620] [2022-04-28 02:59:49,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:49,188 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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 50 [2022-04-28 02:59:49,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:49,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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-28 02:59:49,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:49,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 02:59:49,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:49,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 02:59:49,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1845, Invalid=5127, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 02:59:49,216 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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-28 02:59:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:52,256 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 02:59:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 02:59:52,256 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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 50 [2022-04-28 02:59:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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-28 02:59:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-28 02:59:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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-28 02:59:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-28 02:59:52,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 57 transitions. [2022-04-28 02:59:52,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:52,305 INFO L225 Difference]: With dead ends: 57 [2022-04-28 02:59:52,305 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 02:59:52,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3683, Invalid=11569, Unknown=0, NotChecked=0, Total=15252 [2022-04-28 02:59:52,306 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:52,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 02:59:52,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 02:59:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 02:59:52,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:52,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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-28 02:59:52,353 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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-28 02:59:52,353 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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-28 02:59:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:52,353 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 02:59:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 02:59:52,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:52,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:52,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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 52 states. [2022-04-28 02:59:52,354 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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 52 states. [2022-04-28 02:59:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:52,354 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 02:59:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 02:59:52,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:52,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:52,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:52,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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-28 02:59:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-28 02:59:52,355 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2022-04-28 02:59:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:52,355 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-28 02:59:52,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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-28 02:59:52,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-28 02:59:52,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 02:59:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 02:59:52,407 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:52,407 INFO L195 NwaCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:52,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:52,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79 [2022-04-28 02:59:52,612 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:52,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:52,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1557621980, now seen corresponding path program 79 times [2022-04-28 02:59:52,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:52,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [896450394] [2022-04-28 02:59:54,055 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:59:54,163 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:59:54,164 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:59:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 437800631, now seen corresponding path program 1 times [2022-04-28 02:59:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:54,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356647783] [2022-04-28 02:59:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:59:54,170 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:59:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:59:54,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:59:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1557621980, now seen corresponding path program 80 times [2022-04-28 02:59:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:54,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288053068] [2022-04-28 02:59:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:55,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {19156#(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(12, 2);call #Ultimate.allocInit(12, 3); {19110#true} is VALID [2022-04-28 02:59:55,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {19110#true} assume true; {19110#true} is VALID [2022-04-28 02:59:55,076 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19110#true} {19110#true} #34#return; {19110#true} is VALID [2022-04-28 02:59:55,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {19110#true} call ULTIMATE.init(); {19156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:55,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {19156#(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(12, 2);call #Ultimate.allocInit(12, 3); {19110#true} is VALID [2022-04-28 02:59:55,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {19110#true} assume true; {19110#true} is VALID [2022-04-28 02:59:55,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19110#true} {19110#true} #34#return; {19110#true} is VALID [2022-04-28 02:59:55,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {19110#true} call #t~ret5 := main(); {19110#true} is VALID [2022-04-28 02:59:55,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {19110#true} ~x~0 := 1;~y~0 := 0; {19115#(= main_~y~0 0)} is VALID [2022-04-28 02:59:55,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {19115#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19116#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:59:55,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {19116#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19117#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:59:55,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {19117#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19118#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:59:55,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {19118#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19119#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:59:55,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {19119#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19120#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:59:55,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {19120#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19121#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:59:55,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {19121#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19122#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:59:55,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {19122#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19123#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:59:55,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {19123#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19124#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:59:55,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {19124#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19125#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:59:55,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {19125#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19126#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:59:55,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {19126#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19127#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:59:55,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {19127#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19128#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:59:55,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {19128#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19129#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:59:55,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {19129#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19130#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:59:55,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {19130#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19131#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:59:55,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {19131#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19132#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:59:55,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {19132#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19133#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:59:55,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {19133#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19134#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:59:55,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {19134#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19135#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:59:55,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {19135#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19136#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:59:55,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {19136#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19137#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:59:55,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {19137#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19138#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:59:55,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {19138#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19139#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:59:55,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {19139#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19140#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:59:55,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {19140#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:59:55,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {19141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19142#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:59:55,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {19142#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19143#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:59:55,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {19143#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19144#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:59:55,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {19144#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19145#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:59:55,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {19145#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19146#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:59:55,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {19146#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19147#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:59:55,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {19147#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19148#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:59:55,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {19148#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19149#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:59:55,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {19149#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19150#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 02:59:55,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {19150#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19151#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 02:59:55,095 INFO L290 TraceCheckUtils]: 42: Hoare triple {19151#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19152#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 02:59:55,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {19152#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19153#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 02:59:55,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {19153#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19154#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 02:59:55,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {19154#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19155#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 40))} is VALID [2022-04-28 02:59:55,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {19155#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 40))} assume !(~y~0 % 4294967296 < 1024); {19111#false} is VALID [2022-04-28 02:59:55,097 INFO L272 TraceCheckUtils]: 47: Hoare triple {19111#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {19111#false} is VALID [2022-04-28 02:59:55,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {19111#false} ~cond := #in~cond; {19111#false} is VALID [2022-04-28 02:59:55,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {19111#false} assume 0 == ~cond; {19111#false} is VALID [2022-04-28 02:59:55,097 INFO L290 TraceCheckUtils]: 50: Hoare triple {19111#false} assume !false; {19111#false} is VALID [2022-04-28 02:59:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:55,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:55,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288053068] [2022-04-28 02:59:55,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288053068] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:55,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174358811] [2022-04-28 02:59:55,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:59:55,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:55,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:55,099 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:55,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 02:59:55,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:59:55,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:55,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-28 02:59:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:55,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:55,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {19110#true} call ULTIMATE.init(); {19110#true} is VALID [2022-04-28 02:59:55,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {19110#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(12, 2);call #Ultimate.allocInit(12, 3); {19110#true} is VALID [2022-04-28 02:59:55,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {19110#true} assume true; {19110#true} is VALID [2022-04-28 02:59:55,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19110#true} {19110#true} #34#return; {19110#true} is VALID [2022-04-28 02:59:55,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {19110#true} call #t~ret5 := main(); {19110#true} is VALID [2022-04-28 02:59:55,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {19110#true} ~x~0 := 1;~y~0 := 0; {19115#(= main_~y~0 0)} is VALID [2022-04-28 02:59:55,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {19115#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19116#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 02:59:55,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {19116#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19117#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 02:59:55,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {19117#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19118#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 02:59:55,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {19118#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19119#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 02:59:55,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {19119#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19120#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 02:59:55,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {19120#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19121#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 02:59:55,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {19121#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19122#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 02:59:55,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {19122#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19123#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 02:59:55,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {19123#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19124#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 02:59:55,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {19124#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19125#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 02:59:55,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {19125#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19126#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 02:59:55,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {19126#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19127#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 02:59:55,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {19127#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19128#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 02:59:55,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {19128#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19129#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 02:59:55,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {19129#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19130#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 02:59:55,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {19130#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19131#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 02:59:55,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {19131#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19132#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 02:59:55,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {19132#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19133#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 02:59:55,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {19133#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19134#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 02:59:55,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {19134#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19135#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 02:59:55,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {19135#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19136#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 02:59:55,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {19136#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19137#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 02:59:55,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {19137#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19138#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 02:59:55,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {19138#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19139#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 02:59:55,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {19139#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19140#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 02:59:55,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {19140#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 02:59:55,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {19141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19142#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 02:59:55,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {19142#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19143#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 02:59:55,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {19143#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19144#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 02:59:55,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {19144#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19145#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 02:59:55,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {19145#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19146#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 02:59:55,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {19146#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19147#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 02:59:55,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {19147#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19148#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 02:59:55,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {19148#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19149#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 02:59:55,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {19149#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19150#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 02:59:55,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {19150#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19151#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 02:59:55,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {19151#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19152#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 02:59:55,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {19152#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19153#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 02:59:55,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {19153#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19154#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 02:59:55,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {19154#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19295#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 02:59:55,700 INFO L290 TraceCheckUtils]: 46: Hoare triple {19295#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !(~y~0 % 4294967296 < 1024); {19111#false} is VALID [2022-04-28 02:59:55,700 INFO L272 TraceCheckUtils]: 47: Hoare triple {19111#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {19111#false} is VALID [2022-04-28 02:59:55,700 INFO L290 TraceCheckUtils]: 48: Hoare triple {19111#false} ~cond := #in~cond; {19111#false} is VALID [2022-04-28 02:59:55,700 INFO L290 TraceCheckUtils]: 49: Hoare triple {19111#false} assume 0 == ~cond; {19111#false} is VALID [2022-04-28 02:59:55,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {19111#false} assume !false; {19111#false} is VALID [2022-04-28 02:59:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:55,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:58,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {19111#false} assume !false; {19111#false} is VALID [2022-04-28 02:59:58,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {19111#false} assume 0 == ~cond; {19111#false} is VALID [2022-04-28 02:59:58,150 INFO L290 TraceCheckUtils]: 48: Hoare triple {19111#false} ~cond := #in~cond; {19111#false} is VALID [2022-04-28 02:59:58,150 INFO L272 TraceCheckUtils]: 47: Hoare triple {19111#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {19111#false} is VALID [2022-04-28 02:59:58,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {19323#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {19111#false} is VALID [2022-04-28 02:59:58,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {19327#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19323#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 02:59:58,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {19331#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19327#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {19335#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19331#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {19339#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19335#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {19343#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19339#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {19347#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19343#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {19351#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19347#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {19355#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19351#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {19359#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19355#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {19363#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19359#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {19367#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19363#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {19371#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19367#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {19375#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19371#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {19379#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19375#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {19383#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19379#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {19387#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19383#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {19391#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19387#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {19395#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19391#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {19399#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19395#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {19403#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19399#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {19407#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19403#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {19411#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19407#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {19415#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19411#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {19419#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19415#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {19423#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19419#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {19427#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19423#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {19431#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19427#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {19435#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19431#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {19439#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19435#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {19443#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19439#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {19447#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19443#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {19451#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19447#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {19455#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19451#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {19459#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19455#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {19463#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19459#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {19467#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19463#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {19471#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19467#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {19475#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19471#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {19479#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19475#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {19483#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19479#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {19110#true} ~x~0 := 1;~y~0 := 0; {19483#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 02:59:58,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {19110#true} call #t~ret5 := main(); {19110#true} is VALID [2022-04-28 02:59:58,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19110#true} {19110#true} #34#return; {19110#true} is VALID [2022-04-28 02:59:58,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {19110#true} assume true; {19110#true} is VALID [2022-04-28 02:59:58,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {19110#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(12, 2);call #Ultimate.allocInit(12, 3); {19110#true} is VALID [2022-04-28 02:59:58,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {19110#true} call ULTIMATE.init(); {19110#true} is VALID [2022-04-28 02:59:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:58,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174358811] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:58,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:58,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-28 02:59:58,177 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:58,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [896450394] [2022-04-28 02:59:58,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [896450394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:58,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:58,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 02:59:58,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057273606] [2022-04-28 02:59:58,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:58,178 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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 51 [2022-04-28 02:59:58,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:58,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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-28 02:59:58,203 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-28 02:59:58,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 02:59:58,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:58,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 02:59:58,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1932, Invalid=5378, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 02:59:58,204 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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-28 03:00:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:01,349 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 03:00:01,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 03:00:01,349 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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 51 [2022-04-28 03:00:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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-28 03:00:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-28 03:00:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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-28 03:00:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-28 03:00:01,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 58 transitions. [2022-04-28 03:00:01,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:01,384 INFO L225 Difference]: With dead ends: 58 [2022-04-28 03:00:01,384 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 03:00:01,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3857, Invalid=12145, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 03:00:01,385 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:01,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:00:01,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 03:00:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-28 03:00:01,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:01,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-28 03:00:01,433 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-28 03:00:01,434 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-28 03:00:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:01,434 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 03:00:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 03:00:01,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:01,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:01,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-28 03:00:01,435 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-28 03:00:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:01,435 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 03:00:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 03:00:01,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:01,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:01,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:01,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-28 03:00:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-28 03:00:01,436 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2022-04-28 03:00:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:01,436 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-28 03:00:01,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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-28 03:00:01,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-28 03:00:01,600 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-28 03:00:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 03:00:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 03:00:01,601 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:01,601 INFO L195 NwaCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:01,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:01,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2022-04-28 03:00:01,807 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:01,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:01,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1078102390, now seen corresponding path program 81 times [2022-04-28 03:00:01,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:01,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [483419932] [2022-04-28 03:00:05,560 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:00:05,703 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:00:05,710 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash 496905975, now seen corresponding path program 1 times [2022-04-28 03:00:05,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:05,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416775648] [2022-04-28 03:00:05,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:05,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:05,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:05,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:05,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1078102390, now seen corresponding path program 82 times [2022-04-28 03:00:05,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:05,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253304222] [2022-04-28 03:00:05,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:05,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:06,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:06,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {19961#(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(12, 2);call #Ultimate.allocInit(12, 3); {19914#true} is VALID [2022-04-28 03:00:06,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {19914#true} assume true; {19914#true} is VALID [2022-04-28 03:00:06,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19914#true} {19914#true} #34#return; {19914#true} is VALID [2022-04-28 03:00:06,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {19914#true} call ULTIMATE.init(); {19961#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:06,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {19961#(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(12, 2);call #Ultimate.allocInit(12, 3); {19914#true} is VALID [2022-04-28 03:00:06,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {19914#true} assume true; {19914#true} is VALID [2022-04-28 03:00:06,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19914#true} {19914#true} #34#return; {19914#true} is VALID [2022-04-28 03:00:06,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {19914#true} call #t~ret5 := main(); {19914#true} is VALID [2022-04-28 03:00:06,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {19914#true} ~x~0 := 1;~y~0 := 0; {19919#(= main_~y~0 0)} is VALID [2022-04-28 03:00:06,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {19919#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19920#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:00:06,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {19920#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19921#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:00:06,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {19921#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19922#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:00:06,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {19922#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19923#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:00:06,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {19923#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19924#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:00:06,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {19924#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19925#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:00:06,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {19925#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19926#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:00:06,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {19926#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19927#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:00:06,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {19927#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19928#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:00:06,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {19928#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19929#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:00:06,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {19929#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:00:06,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {19930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19931#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:00:06,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {19931#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19932#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:00:06,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {19932#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19933#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:00:06,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {19933#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19934#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:00:06,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {19934#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19935#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:00:06,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {19935#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19936#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:00:06,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {19936#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19937#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:00:06,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {19937#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19938#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:00:06,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {19938#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19939#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:00:06,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {19939#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19940#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:00:06,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {19940#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19941#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:00:06,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {19941#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19942#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:00:06,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {19942#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19943#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:00:06,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {19943#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19944#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:00:06,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {19944#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19945#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:00:06,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {19945#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19946#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:00:06,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {19946#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19947#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:00:06,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {19947#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19948#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:00:06,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {19948#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19949#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:00:06,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {19949#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19950#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:00:06,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {19950#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19951#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:00:06,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {19951#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19952#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:00:06,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {19952#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19953#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:00:06,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {19953#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19954#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:00:06,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {19954#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19955#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:00:06,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {19955#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19956#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:00:06,681 INFO L290 TraceCheckUtils]: 43: Hoare triple {19956#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19957#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:00:06,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {19957#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19958#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:00:06,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {19958#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19959#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:00:06,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {19959#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19960#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 41))} is VALID [2022-04-28 03:00:06,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {19960#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 41))} assume !(~y~0 % 4294967296 < 1024); {19915#false} is VALID [2022-04-28 03:00:06,683 INFO L272 TraceCheckUtils]: 48: Hoare triple {19915#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {19915#false} is VALID [2022-04-28 03:00:06,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {19915#false} ~cond := #in~cond; {19915#false} is VALID [2022-04-28 03:00:06,683 INFO L290 TraceCheckUtils]: 50: Hoare triple {19915#false} assume 0 == ~cond; {19915#false} is VALID [2022-04-28 03:00:06,683 INFO L290 TraceCheckUtils]: 51: Hoare triple {19915#false} assume !false; {19915#false} is VALID [2022-04-28 03:00:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:06,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:06,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253304222] [2022-04-28 03:00:06,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253304222] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:06,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665287709] [2022-04-28 03:00:06,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:00:06,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:06,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:06,685 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:00:06,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 03:00:06,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:00:06,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:06,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-28 03:00:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:06,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:07,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {19914#true} call ULTIMATE.init(); {19914#true} is VALID [2022-04-28 03:00:07,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {19914#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(12, 2);call #Ultimate.allocInit(12, 3); {19914#true} is VALID [2022-04-28 03:00:07,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {19914#true} assume true; {19914#true} is VALID [2022-04-28 03:00:07,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19914#true} {19914#true} #34#return; {19914#true} is VALID [2022-04-28 03:00:07,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {19914#true} call #t~ret5 := main(); {19914#true} is VALID [2022-04-28 03:00:07,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {19914#true} ~x~0 := 1;~y~0 := 0; {19919#(= main_~y~0 0)} is VALID [2022-04-28 03:00:07,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {19919#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19920#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:00:07,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {19920#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19921#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:00:07,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {19921#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19922#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:00:07,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {19922#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19923#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:00:07,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {19923#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19924#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:00:07,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {19924#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19925#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:00:07,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {19925#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19926#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:00:07,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {19926#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19927#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:00:07,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {19927#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19928#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:00:07,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {19928#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19929#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:00:07,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {19929#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:00:07,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {19930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19931#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:00:07,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {19931#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19932#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:00:07,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {19932#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19933#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:00:07,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {19933#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19934#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:00:07,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {19934#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19935#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:00:07,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {19935#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19936#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:00:07,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {19936#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19937#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:00:07,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {19937#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19938#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:00:07,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {19938#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19939#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:00:07,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {19939#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19940#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:00:07,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {19940#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19941#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:00:07,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {19941#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19942#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:00:07,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {19942#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19943#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:00:07,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {19943#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19944#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:00:07,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {19944#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19945#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:00:07,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {19945#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19946#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:00:07,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {19946#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19947#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:00:07,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {19947#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19948#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:00:07,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {19948#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19949#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:00:07,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {19949#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19950#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:00:07,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {19950#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19951#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:00:07,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {19951#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19952#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:00:07,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {19952#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19953#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:00:07,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {19953#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19954#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:00:07,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {19954#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19955#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:00:07,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {19955#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19956#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:00:07,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {19956#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19957#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:00:07,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {19957#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19958#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:00:07,271 INFO L290 TraceCheckUtils]: 45: Hoare triple {19958#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {19959#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:00:07,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {19959#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20103#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:00:07,272 INFO L290 TraceCheckUtils]: 47: Hoare triple {20103#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !(~y~0 % 4294967296 < 1024); {19915#false} is VALID [2022-04-28 03:00:07,272 INFO L272 TraceCheckUtils]: 48: Hoare triple {19915#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {19915#false} is VALID [2022-04-28 03:00:07,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {19915#false} ~cond := #in~cond; {19915#false} is VALID [2022-04-28 03:00:07,272 INFO L290 TraceCheckUtils]: 50: Hoare triple {19915#false} assume 0 == ~cond; {19915#false} is VALID [2022-04-28 03:00:07,272 INFO L290 TraceCheckUtils]: 51: Hoare triple {19915#false} assume !false; {19915#false} is VALID [2022-04-28 03:00:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:07,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:09,810 INFO L290 TraceCheckUtils]: 51: Hoare triple {19915#false} assume !false; {19915#false} is VALID [2022-04-28 03:00:09,810 INFO L290 TraceCheckUtils]: 50: Hoare triple {19915#false} assume 0 == ~cond; {19915#false} is VALID [2022-04-28 03:00:09,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {19915#false} ~cond := #in~cond; {19915#false} is VALID [2022-04-28 03:00:09,811 INFO L272 TraceCheckUtils]: 48: Hoare triple {19915#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {19915#false} is VALID [2022-04-28 03:00:09,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {20131#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {19915#false} is VALID [2022-04-28 03:00:09,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {20135#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20131#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:00:09,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {20139#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20135#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {20143#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20139#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {20147#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20143#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {20151#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20147#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {20155#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20151#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {20159#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20155#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {20163#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20159#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {20167#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20163#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {20171#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20167#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {20175#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20171#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {20179#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20175#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {20183#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20179#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {20187#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20183#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {20191#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20187#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {20195#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20191#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {20199#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20195#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {20203#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20199#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {20207#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20203#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {20211#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20207#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {20215#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20211#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {20219#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20215#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {20223#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20219#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {20227#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20223#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {20231#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20227#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {20235#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20231#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {20239#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20235#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {20243#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20239#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {20247#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20243#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {20251#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20247#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {20255#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20251#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {20259#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20255#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {20263#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20259#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {20267#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20263#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {20271#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20267#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {20275#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20271#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {20279#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20275#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {20283#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20279#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {20287#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20283#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {20291#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20287#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {20295#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20291#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {19914#true} ~x~0 := 1;~y~0 := 0; {20295#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:09,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {19914#true} call #t~ret5 := main(); {19914#true} is VALID [2022-04-28 03:00:09,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19914#true} {19914#true} #34#return; {19914#true} is VALID [2022-04-28 03:00:09,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {19914#true} assume true; {19914#true} is VALID [2022-04-28 03:00:09,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {19914#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(12, 2);call #Ultimate.allocInit(12, 3); {19914#true} is VALID [2022-04-28 03:00:09,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {19914#true} call ULTIMATE.init(); {19914#true} is VALID [2022-04-28 03:00:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:09,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665287709] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:09,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:09,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 88 [2022-04-28 03:00:09,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:09,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [483419932] [2022-04-28 03:00:09,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [483419932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:09,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:09,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 03:00:09,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457041007] [2022-04-28 03:00:09,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:09,843 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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 52 [2022-04-28 03:00:09,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:09,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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-28 03:00:09,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:09,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 03:00:09,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:09,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 03:00:09,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2021, Invalid=5635, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 03:00:09,869 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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-28 03:00:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:13,494 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 03:00:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 03:00:13,494 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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 52 [2022-04-28 03:00:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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-28 03:00:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-28 03:00:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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-28 03:00:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-28 03:00:13,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-28 03:00:13,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:13,533 INFO L225 Difference]: With dead ends: 59 [2022-04-28 03:00:13,534 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 03:00:13,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4035, Invalid=12735, Unknown=0, NotChecked=0, Total=16770 [2022-04-28 03:00:13,535 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:13,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:00:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 03:00:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 03:00:13,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:13,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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-28 03:00:13,602 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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-28 03:00:13,603 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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-28 03:00:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:13,604 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 03:00:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 03:00:13,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:13,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:13,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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 54 states. [2022-04-28 03:00:13,605 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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 54 states. [2022-04-28 03:00:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:13,605 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 03:00:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 03:00:13,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:13,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:13,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:13,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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-28 03:00:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-28 03:00:13,606 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2022-04-28 03:00:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:13,606 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-28 03:00:13,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 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-28 03:00:13,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 54 transitions. [2022-04-28 03:00:13,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 03:00:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 03:00:13,649 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:13,649 INFO L195 NwaCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:13,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:13,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:13,862 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:13,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:13,862 INFO L85 PathProgramCache]: Analyzing trace with hash -902103012, now seen corresponding path program 83 times [2022-04-28 03:00:13,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:13,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [178986828] [2022-04-28 03:00:15,371 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:00:15,493 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:00:15,494 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash 556011319, now seen corresponding path program 1 times [2022-04-28 03:00:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:15,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408520375] [2022-04-28 03:00:15,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:15,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:15,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:15,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash -902103012, now seen corresponding path program 84 times [2022-04-28 03:00:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:15,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556594580] [2022-04-28 03:00:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:15,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:16,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:16,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {20782#(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(12, 2);call #Ultimate.allocInit(12, 3); {20734#true} is VALID [2022-04-28 03:00:16,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {20734#true} assume true; {20734#true} is VALID [2022-04-28 03:00:16,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20734#true} {20734#true} #34#return; {20734#true} is VALID [2022-04-28 03:00:16,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {20734#true} call ULTIMATE.init(); {20782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:16,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {20782#(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(12, 2);call #Ultimate.allocInit(12, 3); {20734#true} is VALID [2022-04-28 03:00:16,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {20734#true} assume true; {20734#true} is VALID [2022-04-28 03:00:16,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20734#true} {20734#true} #34#return; {20734#true} is VALID [2022-04-28 03:00:16,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {20734#true} call #t~ret5 := main(); {20734#true} is VALID [2022-04-28 03:00:16,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {20734#true} ~x~0 := 1;~y~0 := 0; {20739#(= main_~y~0 0)} is VALID [2022-04-28 03:00:16,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {20739#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20740#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:00:16,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {20740#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20741#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:00:16,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {20741#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20742#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:00:16,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {20742#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20743#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:00:16,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {20743#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20744#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:00:16,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {20744#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20745#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:00:16,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {20745#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20746#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:00:16,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {20746#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20747#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:00:16,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {20747#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20748#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:00:16,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {20748#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20749#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:00:16,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {20749#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20750#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:00:16,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {20750#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20751#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:00:16,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {20751#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20752#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:00:16,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {20752#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20753#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:00:16,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {20753#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20754#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:00:16,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {20754#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20755#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:00:16,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {20755#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20756#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:00:16,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {20756#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20757#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:00:16,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {20757#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20758#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:00:16,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {20758#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20759#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:00:16,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {20759#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20760#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:00:16,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {20760#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20761#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:00:16,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {20761#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20762#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:00:16,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {20762#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20763#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:00:16,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {20763#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20764#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:00:16,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {20764#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20765#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:00:16,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {20765#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20766#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:00:16,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {20766#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20767#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:00:16,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {20767#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20768#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:00:16,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {20768#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20769#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:00:16,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {20769#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20770#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:00:16,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {20770#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20771#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:00:16,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {20771#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20772#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:00:16,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {20772#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20773#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:00:16,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {20773#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20774#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:00:16,637 INFO L290 TraceCheckUtils]: 41: Hoare triple {20774#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20775#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:00:16,637 INFO L290 TraceCheckUtils]: 42: Hoare triple {20775#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20776#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:00:16,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {20776#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20777#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:00:16,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {20777#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20778#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:00:16,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {20778#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20779#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:00:16,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {20779#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20780#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:00:16,640 INFO L290 TraceCheckUtils]: 47: Hoare triple {20780#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20781#(and (<= main_~y~0 42) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:16,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {20781#(and (<= main_~y~0 42) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {20735#false} is VALID [2022-04-28 03:00:16,640 INFO L272 TraceCheckUtils]: 49: Hoare triple {20735#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {20735#false} is VALID [2022-04-28 03:00:16,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {20735#false} ~cond := #in~cond; {20735#false} is VALID [2022-04-28 03:00:16,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {20735#false} assume 0 == ~cond; {20735#false} is VALID [2022-04-28 03:00:16,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {20735#false} assume !false; {20735#false} is VALID [2022-04-28 03:00:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:16,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:16,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556594580] [2022-04-28 03:00:16,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556594580] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:16,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743953993] [2022-04-28 03:00:16,641 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:00:16,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:16,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:16,642 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:00:16,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 03:00:20,136 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-28 03:00:20,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:20,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 87 conjunts are in the unsatisfiable core [2022-04-28 03:00:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:20,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:20,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {20734#true} call ULTIMATE.init(); {20734#true} is VALID [2022-04-28 03:00:20,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {20734#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(12, 2);call #Ultimate.allocInit(12, 3); {20734#true} is VALID [2022-04-28 03:00:20,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {20734#true} assume true; {20734#true} is VALID [2022-04-28 03:00:20,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20734#true} {20734#true} #34#return; {20734#true} is VALID [2022-04-28 03:00:20,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {20734#true} call #t~ret5 := main(); {20734#true} is VALID [2022-04-28 03:00:20,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {20734#true} ~x~0 := 1;~y~0 := 0; {20739#(= main_~y~0 0)} is VALID [2022-04-28 03:00:20,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {20739#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20740#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:00:20,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {20740#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20741#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:00:20,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {20741#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20742#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:00:20,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {20742#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20743#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:00:20,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {20743#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20744#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:00:20,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {20744#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20745#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:00:20,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {20745#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20746#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:00:20,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {20746#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20747#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:00:20,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {20747#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20748#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:00:20,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {20748#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20749#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:00:20,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {20749#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20750#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:00:20,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {20750#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20751#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:00:20,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {20751#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20752#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:00:20,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {20752#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20753#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:00:20,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {20753#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20754#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:00:20,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {20754#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20755#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:00:20,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {20755#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20756#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:00:20,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {20756#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20757#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:00:20,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {20757#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20758#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:00:20,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {20758#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20759#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:00:20,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {20759#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20760#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:00:20,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {20760#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20761#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:00:20,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {20761#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20762#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:00:20,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {20762#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20763#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:00:20,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {20763#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20764#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:00:20,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {20764#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20765#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:00:20,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {20765#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20766#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:00:20,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {20766#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20767#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:00:20,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {20767#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20768#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:00:20,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {20768#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20769#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:00:20,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {20769#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20770#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:00:20,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {20770#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20771#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:00:20,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {20771#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20772#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:00:20,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {20772#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20773#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:00:20,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {20773#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20774#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:00:20,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {20774#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20775#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:00:20,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {20775#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20776#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:00:20,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {20776#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20777#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:00:20,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {20777#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20778#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:00:20,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {20778#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20779#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:00:20,651 INFO L290 TraceCheckUtils]: 46: Hoare triple {20779#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20780#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:00:20,652 INFO L290 TraceCheckUtils]: 47: Hoare triple {20780#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20927#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:00:20,652 INFO L290 TraceCheckUtils]: 48: Hoare triple {20927#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {20735#false} is VALID [2022-04-28 03:00:20,652 INFO L272 TraceCheckUtils]: 49: Hoare triple {20735#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {20735#false} is VALID [2022-04-28 03:00:20,652 INFO L290 TraceCheckUtils]: 50: Hoare triple {20735#false} ~cond := #in~cond; {20735#false} is VALID [2022-04-28 03:00:20,652 INFO L290 TraceCheckUtils]: 51: Hoare triple {20735#false} assume 0 == ~cond; {20735#false} is VALID [2022-04-28 03:00:20,652 INFO L290 TraceCheckUtils]: 52: Hoare triple {20735#false} assume !false; {20735#false} is VALID [2022-04-28 03:00:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:20,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:23,566 INFO L290 TraceCheckUtils]: 52: Hoare triple {20735#false} assume !false; {20735#false} is VALID [2022-04-28 03:00:23,566 INFO L290 TraceCheckUtils]: 51: Hoare triple {20735#false} assume 0 == ~cond; {20735#false} is VALID [2022-04-28 03:00:23,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {20735#false} ~cond := #in~cond; {20735#false} is VALID [2022-04-28 03:00:23,566 INFO L272 TraceCheckUtils]: 49: Hoare triple {20735#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {20735#false} is VALID [2022-04-28 03:00:23,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {20955#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {20735#false} is VALID [2022-04-28 03:00:23,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {20959#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20955#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:00:23,568 INFO L290 TraceCheckUtils]: 46: Hoare triple {20963#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20959#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {20967#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20963#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,569 INFO L290 TraceCheckUtils]: 44: Hoare triple {20971#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20967#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {20975#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20971#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {20979#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20975#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {20983#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20979#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {20987#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20983#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {20991#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20987#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {20995#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20991#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {20999#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20995#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {21003#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {20999#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {21007#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21003#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {21011#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21007#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {21015#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21011#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {21019#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21015#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {21023#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21019#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {21027#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21023#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {21031#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21027#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {21035#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21031#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {21039#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21035#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {21043#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21039#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {21047#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21043#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {21051#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21047#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {21055#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21051#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {21059#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21055#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {21063#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21059#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {21067#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21063#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {21071#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21067#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {21075#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21071#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {21079#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21075#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {21083#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21079#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {21087#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21083#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {21091#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21087#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {21095#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21091#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {21099#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21095#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {21103#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21099#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {21107#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21103#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {21111#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21107#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {21115#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21111#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {21119#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21115#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {21123#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21119#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {20734#true} ~x~0 := 1;~y~0 := 0; {21123#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:23,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {20734#true} call #t~ret5 := main(); {20734#true} is VALID [2022-04-28 03:00:23,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20734#true} {20734#true} #34#return; {20734#true} is VALID [2022-04-28 03:00:23,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {20734#true} assume true; {20734#true} is VALID [2022-04-28 03:00:23,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {20734#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(12, 2);call #Ultimate.allocInit(12, 3); {20734#true} is VALID [2022-04-28 03:00:23,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {20734#true} call ULTIMATE.init(); {20734#true} is VALID [2022-04-28 03:00:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:23,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743953993] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:23,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:23,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 90 [2022-04-28 03:00:23,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:23,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [178986828] [2022-04-28 03:00:23,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [178986828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:23,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:23,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 03:00:23,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027886556] [2022-04-28 03:00:23,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:23,595 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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 53 [2022-04-28 03:00:23,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:23,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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-28 03:00:23,643 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-28 03:00:23,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 03:00:23,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:23,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 03:00:23,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2112, Invalid=5898, Unknown=0, NotChecked=0, Total=8010 [2022-04-28 03:00:23,644 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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-28 03:00:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:27,151 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 03:00:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 03:00:27,151 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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 53 [2022-04-28 03:00:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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-28 03:00:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-28 03:00:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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-28 03:00:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-28 03:00:27,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 60 transitions. [2022-04-28 03:00:27,189 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-28 03:00:27,190 INFO L225 Difference]: With dead ends: 60 [2022-04-28 03:00:27,190 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 03:00:27,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4217, Invalid=13339, Unknown=0, NotChecked=0, Total=17556 [2022-04-28 03:00:27,191 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1853 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:27,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 58 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1853 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:00:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 03:00:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 03:00:27,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:27,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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-28 03:00:27,241 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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-28 03:00:27,241 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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-28 03:00:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:27,242 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 03:00:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 03:00:27,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:27,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:27,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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 55 states. [2022-04-28 03:00:27,242 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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 55 states. [2022-04-28 03:00:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:27,243 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 03:00:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 03:00:27,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:27,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:27,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:27,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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-28 03:00:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-28 03:00:27,244 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2022-04-28 03:00:27,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:27,245 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-28 03:00:27,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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-28 03:00:27,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-28 03:00:27,283 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-28 03:00:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 03:00:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 03:00:27,283 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:27,283 INFO L195 NwaCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:27,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:27,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:27,489 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2136038966, now seen corresponding path program 85 times [2022-04-28 03:00:27,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:27,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [279104481] [2022-04-28 03:00:29,007 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:00:29,150 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:00:29,152 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash 615116663, now seen corresponding path program 1 times [2022-04-28 03:00:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:29,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014266856] [2022-04-28 03:00:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:29,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:29,158 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:29,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:29,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2136038966, now seen corresponding path program 86 times [2022-04-28 03:00:29,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:29,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988216063] [2022-04-28 03:00:29,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:29,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:30,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {21619#(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(12, 2);call #Ultimate.allocInit(12, 3); {21570#true} is VALID [2022-04-28 03:00:30,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {21570#true} assume true; {21570#true} is VALID [2022-04-28 03:00:30,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21570#true} {21570#true} #34#return; {21570#true} is VALID [2022-04-28 03:00:30,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {21570#true} call ULTIMATE.init(); {21619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:30,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {21619#(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(12, 2);call #Ultimate.allocInit(12, 3); {21570#true} is VALID [2022-04-28 03:00:30,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {21570#true} assume true; {21570#true} is VALID [2022-04-28 03:00:30,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21570#true} {21570#true} #34#return; {21570#true} is VALID [2022-04-28 03:00:30,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {21570#true} call #t~ret5 := main(); {21570#true} is VALID [2022-04-28 03:00:30,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {21570#true} ~x~0 := 1;~y~0 := 0; {21575#(= main_~y~0 0)} is VALID [2022-04-28 03:00:30,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {21575#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21576#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:00:30,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {21576#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21577#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:00:30,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {21577#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21578#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:00:30,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {21578#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21579#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:00:30,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {21579#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21580#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:00:30,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {21580#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21581#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:00:30,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {21581#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21582#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:00:30,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {21582#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21583#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:00:30,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {21583#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21584#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:00:30,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {21584#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21585#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:00:30,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {21585#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21586#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:00:30,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {21586#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21587#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:00:30,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {21587#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21588#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:00:30,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {21588#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21589#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:00:30,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {21589#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21590#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:00:30,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {21590#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21591#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:00:30,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {21591#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21592#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:00:30,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {21592#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21593#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:00:30,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {21593#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21594#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:00:30,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {21594#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21595#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:00:30,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {21595#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21596#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:00:30,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {21596#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21597#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:00:30,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {21597#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21598#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:00:30,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {21598#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21599#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:00:30,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {21599#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21600#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:00:30,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {21600#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21601#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:00:30,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {21601#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21602#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:00:30,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {21602#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21603#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:00:30,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {21603#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21604#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:00:30,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {21604#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21605#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:00:30,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {21605#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21606#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:00:30,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {21606#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21607#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:00:30,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {21607#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21608#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:00:30,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {21608#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21609#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:00:30,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {21609#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21610#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:00:30,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {21610#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21611#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:00:30,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {21611#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21612#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:00:30,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {21612#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21613#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:00:30,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {21613#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21614#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:00:30,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {21614#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21615#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:00:30,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {21615#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21616#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:00:30,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {21616#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21617#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:00:30,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {21617#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21618#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 43))} is VALID [2022-04-28 03:00:30,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {21618#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 43))} assume !(~y~0 % 4294967296 < 1024); {21571#false} is VALID [2022-04-28 03:00:30,275 INFO L272 TraceCheckUtils]: 50: Hoare triple {21571#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {21571#false} is VALID [2022-04-28 03:00:30,275 INFO L290 TraceCheckUtils]: 51: Hoare triple {21571#false} ~cond := #in~cond; {21571#false} is VALID [2022-04-28 03:00:30,275 INFO L290 TraceCheckUtils]: 52: Hoare triple {21571#false} assume 0 == ~cond; {21571#false} is VALID [2022-04-28 03:00:30,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {21571#false} assume !false; {21571#false} is VALID [2022-04-28 03:00:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:30,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:30,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988216063] [2022-04-28 03:00:30,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988216063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:30,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636726891] [2022-04-28 03:00:30,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:00:30,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:30,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:30,276 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:00:30,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 03:00:30,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:00:30,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:30,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 89 conjunts are in the unsatisfiable core [2022-04-28 03:00:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:30,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:30,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {21570#true} call ULTIMATE.init(); {21570#true} is VALID [2022-04-28 03:00:30,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {21570#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(12, 2);call #Ultimate.allocInit(12, 3); {21570#true} is VALID [2022-04-28 03:00:30,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {21570#true} assume true; {21570#true} is VALID [2022-04-28 03:00:30,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21570#true} {21570#true} #34#return; {21570#true} is VALID [2022-04-28 03:00:30,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {21570#true} call #t~ret5 := main(); {21570#true} is VALID [2022-04-28 03:00:30,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {21570#true} ~x~0 := 1;~y~0 := 0; {21575#(= main_~y~0 0)} is VALID [2022-04-28 03:00:30,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {21575#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21576#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:00:30,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {21576#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21577#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:00:30,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {21577#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21578#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:00:30,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {21578#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21579#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:00:30,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {21579#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21580#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:00:30,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {21580#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21581#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:00:30,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {21581#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21582#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:00:30,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {21582#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21583#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:00:30,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {21583#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21584#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:00:30,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {21584#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21585#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:00:30,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {21585#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21586#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:00:30,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {21586#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21587#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:00:30,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {21587#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21588#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:00:30,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {21588#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21589#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:00:30,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {21589#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21590#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:00:30,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {21590#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21591#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:00:30,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {21591#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21592#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:00:30,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {21592#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21593#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:00:30,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {21593#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21594#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:00:30,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {21594#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21595#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:00:30,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {21595#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21596#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:00:30,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {21596#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21597#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:00:30,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {21597#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21598#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:00:30,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {21598#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21599#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:00:30,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {21599#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21600#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:00:30,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {21600#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21601#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:00:30,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {21601#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21602#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:00:30,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {21602#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21603#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:00:30,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {21603#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21604#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:00:30,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {21604#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21605#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:00:30,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {21605#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21606#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:00:30,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {21606#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21607#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:00:30,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {21607#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21608#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:00:30,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {21608#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21609#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:00:30,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {21609#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21610#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:00:30,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {21610#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21611#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:00:30,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {21611#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21612#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:00:30,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {21612#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21613#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:00:30,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {21613#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21614#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:00:30,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {21614#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21615#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:00:30,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {21615#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21616#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:00:30,943 INFO L290 TraceCheckUtils]: 47: Hoare triple {21616#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21617#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:00:30,943 INFO L290 TraceCheckUtils]: 48: Hoare triple {21617#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21767#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:00:30,944 INFO L290 TraceCheckUtils]: 49: Hoare triple {21767#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !(~y~0 % 4294967296 < 1024); {21571#false} is VALID [2022-04-28 03:00:30,944 INFO L272 TraceCheckUtils]: 50: Hoare triple {21571#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {21571#false} is VALID [2022-04-28 03:00:30,944 INFO L290 TraceCheckUtils]: 51: Hoare triple {21571#false} ~cond := #in~cond; {21571#false} is VALID [2022-04-28 03:00:30,944 INFO L290 TraceCheckUtils]: 52: Hoare triple {21571#false} assume 0 == ~cond; {21571#false} is VALID [2022-04-28 03:00:30,944 INFO L290 TraceCheckUtils]: 53: Hoare triple {21571#false} assume !false; {21571#false} is VALID [2022-04-28 03:00:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:30,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:33,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {21571#false} assume !false; {21571#false} is VALID [2022-04-28 03:00:33,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {21571#false} assume 0 == ~cond; {21571#false} is VALID [2022-04-28 03:00:33,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {21571#false} ~cond := #in~cond; {21571#false} is VALID [2022-04-28 03:00:33,991 INFO L272 TraceCheckUtils]: 50: Hoare triple {21571#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {21571#false} is VALID [2022-04-28 03:00:33,991 INFO L290 TraceCheckUtils]: 49: Hoare triple {21795#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {21571#false} is VALID [2022-04-28 03:00:33,992 INFO L290 TraceCheckUtils]: 48: Hoare triple {21799#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21795#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:00:33,992 INFO L290 TraceCheckUtils]: 47: Hoare triple {21803#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21799#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:00:33,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {21807#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21803#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:00:33,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {21811#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21807#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:00:33,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {21815#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21811#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:00:33,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {21819#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21815#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:33,995 INFO L290 TraceCheckUtils]: 42: Hoare triple {21823#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21819#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {21827#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21823#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {21831#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21827#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {21835#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21831#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {21839#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21835#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {21843#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21839#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {21847#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21843#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {21851#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21847#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {21855#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21851#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {21859#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21855#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {21863#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21859#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {21867#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21863#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {21871#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21867#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {21875#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21871#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {21879#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21875#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {21883#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21879#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {21887#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21883#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {21891#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21887#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {21895#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21891#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {21899#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21895#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {21903#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21899#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {21907#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21903#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {21911#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21907#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {21915#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21911#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {21919#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21915#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {21923#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21919#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {21927#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21923#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {21931#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21927#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {21935#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21931#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {21939#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21935#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {21943#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21939#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {21947#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21943#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {21951#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21947#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {21955#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21951#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {21959#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21955#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {21963#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21959#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {21967#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {21963#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {21570#true} ~x~0 := 1;~y~0 := 0; {21967#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:00:34,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {21570#true} call #t~ret5 := main(); {21570#true} is VALID [2022-04-28 03:00:34,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21570#true} {21570#true} #34#return; {21570#true} is VALID [2022-04-28 03:00:34,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {21570#true} assume true; {21570#true} is VALID [2022-04-28 03:00:34,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {21570#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(12, 2);call #Ultimate.allocInit(12, 3); {21570#true} is VALID [2022-04-28 03:00:34,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {21570#true} call ULTIMATE.init(); {21570#true} is VALID [2022-04-28 03:00:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:34,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636726891] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:34,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:34,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-28 03:00:34,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:34,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [279104481] [2022-04-28 03:00:34,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [279104481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:34,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:34,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 03:00:34,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787617689] [2022-04-28 03:00:34,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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 54 [2022-04-28 03:00:34,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:34,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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-28 03:00:34,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:34,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 03:00:34,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:34,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 03:00:34,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2205, Invalid=6167, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 03:00:34,068 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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-28 03:00:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:38,211 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 03:00:38,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 03:00:38,211 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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 54 [2022-04-28 03:00:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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-28 03:00:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-28 03:00:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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-28 03:00:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-28 03:00:38,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 61 transitions. [2022-04-28 03:00:38,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:38,256 INFO L225 Difference]: With dead ends: 61 [2022-04-28 03:00:38,256 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 03:00:38,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4403, Invalid=13957, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 03:00:38,257 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:38,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 03:00:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 03:00:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 03:00:38,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:38,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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-28 03:00:38,331 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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-28 03:00:38,331 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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-28 03:00:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:38,332 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 03:00:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 03:00:38,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:38,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:38,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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 56 states. [2022-04-28 03:00:38,332 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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 56 states. [2022-04-28 03:00:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:38,333 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 03:00:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 03:00:38,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:38,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:38,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:38,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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-28 03:00:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-28 03:00:38,334 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2022-04-28 03:00:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:38,334 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-28 03:00:38,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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-28 03:00:38,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2022-04-28 03:00:38,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 03:00:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 03:00:38,378 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:38,378 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:38,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:38,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87 [2022-04-28 03:00:38,578 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:38,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1829159772, now seen corresponding path program 87 times [2022-04-28 03:00:38,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:38,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [874991667] [2022-04-28 03:00:40,372 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:00:40,560 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:00:40,561 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash 674222007, now seen corresponding path program 1 times [2022-04-28 03:00:40,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:40,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978941192] [2022-04-28 03:00:40,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:40,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:40,568 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:40,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:40,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1829159772, now seen corresponding path program 88 times [2022-04-28 03:00:40,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:40,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876433344] [2022-04-28 03:00:40,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:40,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:41,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:41,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {22472#(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(12, 2);call #Ultimate.allocInit(12, 3); {22422#true} is VALID [2022-04-28 03:00:41,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 03:00:41,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22422#true} {22422#true} #34#return; {22422#true} is VALID [2022-04-28 03:00:41,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {22422#true} call ULTIMATE.init(); {22472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:41,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {22472#(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(12, 2);call #Ultimate.allocInit(12, 3); {22422#true} is VALID [2022-04-28 03:00:41,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 03:00:41,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22422#true} {22422#true} #34#return; {22422#true} is VALID [2022-04-28 03:00:41,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {22422#true} call #t~ret5 := main(); {22422#true} is VALID [2022-04-28 03:00:41,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {22422#true} ~x~0 := 1;~y~0 := 0; {22427#(= main_~y~0 0)} is VALID [2022-04-28 03:00:41,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {22427#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:00:41,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {22428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:00:41,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {22429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:00:41,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {22430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:00:41,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {22431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:00:41,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {22432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:00:41,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {22433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:00:41,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {22434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:00:41,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {22435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:00:41,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {22436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:00:41,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {22437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22438#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:00:41,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {22438#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22439#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:00:41,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {22439#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:00:41,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {22440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22441#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:00:41,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {22441#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22442#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:00:41,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {22442#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22443#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:00:41,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {22443#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22444#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:00:41,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {22444#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22445#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:00:41,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {22445#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22446#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:00:41,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {22446#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22447#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:00:41,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {22447#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22448#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:00:41,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {22448#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22449#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:00:41,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {22449#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22450#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:00:41,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {22450#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22451#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:00:41,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {22451#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22452#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:00:41,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {22452#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22453#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:00:41,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {22453#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22454#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:00:41,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {22454#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22455#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:00:41,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {22455#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22456#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:00:41,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {22456#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22457#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:00:41,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {22457#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22458#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:00:41,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {22458#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22459#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:00:41,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {22459#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22460#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:00:41,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {22460#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22461#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:00:41,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {22461#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22462#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:00:41,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {22462#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22463#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:00:41,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {22463#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22464#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:00:41,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {22464#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22465#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:00:41,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {22465#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22466#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:00:41,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {22466#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22467#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:00:41,634 INFO L290 TraceCheckUtils]: 46: Hoare triple {22467#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22468#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:00:41,635 INFO L290 TraceCheckUtils]: 47: Hoare triple {22468#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22469#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:00:41,635 INFO L290 TraceCheckUtils]: 48: Hoare triple {22469#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22470#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:00:41,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {22470#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22471#(and (<= main_~y~0 44) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:41,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {22471#(and (<= main_~y~0 44) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {22423#false} is VALID [2022-04-28 03:00:41,636 INFO L272 TraceCheckUtils]: 51: Hoare triple {22423#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {22423#false} is VALID [2022-04-28 03:00:41,636 INFO L290 TraceCheckUtils]: 52: Hoare triple {22423#false} ~cond := #in~cond; {22423#false} is VALID [2022-04-28 03:00:41,636 INFO L290 TraceCheckUtils]: 53: Hoare triple {22423#false} assume 0 == ~cond; {22423#false} is VALID [2022-04-28 03:00:41,636 INFO L290 TraceCheckUtils]: 54: Hoare triple {22423#false} assume !false; {22423#false} is VALID [2022-04-28 03:00:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:41,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:41,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876433344] [2022-04-28 03:00:41,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876433344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:41,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316440156] [2022-04-28 03:00:41,637 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:00:41,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:41,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:41,638 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:00:41,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 03:00:41,773 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:00:41,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:41,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 91 conjunts are in the unsatisfiable core [2022-04-28 03:00:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:41,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:42,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {22422#true} call ULTIMATE.init(); {22422#true} is VALID [2022-04-28 03:00:42,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {22422#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(12, 2);call #Ultimate.allocInit(12, 3); {22422#true} is VALID [2022-04-28 03:00:42,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 03:00:42,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22422#true} {22422#true} #34#return; {22422#true} is VALID [2022-04-28 03:00:42,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {22422#true} call #t~ret5 := main(); {22422#true} is VALID [2022-04-28 03:00:42,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {22422#true} ~x~0 := 1;~y~0 := 0; {22427#(= main_~y~0 0)} is VALID [2022-04-28 03:00:42,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {22427#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:00:42,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {22428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:00:42,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {22429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:00:42,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {22430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:00:42,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {22431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:00:42,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {22432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:00:42,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {22433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:00:42,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {22434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:00:42,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {22435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:00:42,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {22436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:00:42,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {22437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22438#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:00:42,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {22438#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22439#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:00:42,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {22439#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:00:42,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {22440#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22441#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:00:42,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {22441#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22442#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:00:42,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {22442#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22443#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:00:42,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {22443#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22444#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:00:42,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {22444#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22445#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:00:42,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {22445#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22446#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:00:42,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {22446#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22447#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:00:42,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {22447#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22448#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:00:42,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {22448#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22449#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:00:42,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {22449#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22450#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:00:42,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {22450#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22451#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:00:42,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {22451#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22452#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:00:42,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {22452#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22453#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:00:42,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {22453#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22454#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:00:42,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {22454#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22455#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:00:42,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {22455#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22456#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:00:42,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {22456#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22457#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:00:42,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {22457#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22458#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:00:42,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {22458#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22459#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:00:42,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {22459#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22460#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:00:42,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {22460#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22461#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:00:42,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {22461#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22462#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:00:42,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {22462#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22463#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:00:42,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {22463#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22464#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:00:42,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {22464#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22465#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:00:42,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {22465#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22466#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:00:42,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {22466#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22467#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:00:42,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {22467#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22468#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:00:42,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {22468#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22469#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:00:42,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {22469#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22470#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:00:42,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {22470#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22623#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:00:42,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {22423#false} is VALID [2022-04-28 03:00:42,304 INFO L272 TraceCheckUtils]: 51: Hoare triple {22423#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {22423#false} is VALID [2022-04-28 03:00:42,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {22423#false} ~cond := #in~cond; {22423#false} is VALID [2022-04-28 03:00:42,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {22423#false} assume 0 == ~cond; {22423#false} is VALID [2022-04-28 03:00:42,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {22423#false} assume !false; {22423#false} is VALID [2022-04-28 03:00:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:42,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:45,544 INFO L290 TraceCheckUtils]: 54: Hoare triple {22423#false} assume !false; {22423#false} is VALID [2022-04-28 03:00:45,544 INFO L290 TraceCheckUtils]: 53: Hoare triple {22423#false} assume 0 == ~cond; {22423#false} is VALID [2022-04-28 03:00:45,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {22423#false} ~cond := #in~cond; {22423#false} is VALID [2022-04-28 03:00:45,545 INFO L272 TraceCheckUtils]: 51: Hoare triple {22423#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {22423#false} is VALID [2022-04-28 03:00:45,545 INFO L290 TraceCheckUtils]: 50: Hoare triple {22651#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {22423#false} is VALID [2022-04-28 03:00:45,545 INFO L290 TraceCheckUtils]: 49: Hoare triple {22655#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22651#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:00:45,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {22659#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22655#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,547 INFO L290 TraceCheckUtils]: 47: Hoare triple {22663#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22659#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,547 INFO L290 TraceCheckUtils]: 46: Hoare triple {22667#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22663#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {22671#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22667#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {22675#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22671#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {22679#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22675#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {22683#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22679#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {22687#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22683#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {22691#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22687#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {22695#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22691#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {22699#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22695#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {22703#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22699#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {22707#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22703#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {22711#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22707#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {22715#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22711#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {22719#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22715#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {22723#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22719#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {22727#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22723#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {22731#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22727#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {22735#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22731#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {22739#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22735#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {22743#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22739#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {22747#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22743#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {22751#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22747#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {22755#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22751#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {22759#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22755#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {22763#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22759#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {22767#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22763#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {22771#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22767#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {22775#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22771#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {22779#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22775#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {22783#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22779#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {22787#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22783#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {22791#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22787#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {22795#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22791#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {22799#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22795#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {22803#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22799#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {22807#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22803#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {22811#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22807#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {22815#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22811#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {22819#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22815#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {22823#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22819#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {22827#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {22823#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {22422#true} ~x~0 := 1;~y~0 := 0; {22827#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:00:45,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {22422#true} call #t~ret5 := main(); {22422#true} is VALID [2022-04-28 03:00:45,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22422#true} {22422#true} #34#return; {22422#true} is VALID [2022-04-28 03:00:45,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {22422#true} assume true; {22422#true} is VALID [2022-04-28 03:00:45,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {22422#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(12, 2);call #Ultimate.allocInit(12, 3); {22422#true} is VALID [2022-04-28 03:00:45,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {22422#true} call ULTIMATE.init(); {22422#true} is VALID [2022-04-28 03:00:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:45,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316440156] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:45,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:45,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 94 [2022-04-28 03:00:45,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:45,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [874991667] [2022-04-28 03:00:45,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [874991667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:45,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:45,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 03:00:45,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280338936] [2022-04-28 03:00:45,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:45,576 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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 55 [2022-04-28 03:00:45,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:45,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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-28 03:00:45,603 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-28 03:00:45,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 03:00:45,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:45,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 03:00:45,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=6442, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 03:00:45,604 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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-28 03:00:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:49,574 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 03:00:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 03:00:49,574 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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 55 [2022-04-28 03:00:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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-28 03:00:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-28 03:00:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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-28 03:00:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-28 03:00:49,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 62 transitions. [2022-04-28 03:00:49,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:49,623 INFO L225 Difference]: With dead ends: 62 [2022-04-28 03:00:49,623 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 03:00:49,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4593, Invalid=14589, Unknown=0, NotChecked=0, Total=19182 [2022-04-28 03:00:49,625 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:49,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:00:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 03:00:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 03:00:49,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:49,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-28 03:00:49,678 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-28 03:00:49,678 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-28 03:00:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:49,679 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 03:00:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 03:00:49,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:49,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:49,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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 57 states. [2022-04-28 03:00:49,679 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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 57 states. [2022-04-28 03:00:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:49,680 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 03:00:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 03:00:49,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:49,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:49,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:49,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-28 03:00:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-28 03:00:49,681 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2022-04-28 03:00:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:49,681 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-28 03:00:49,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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-28 03:00:49,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-28 03:00:49,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 03:00:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 03:00:49,721 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:49,721 INFO L195 NwaCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:49,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:49,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89 [2022-04-28 03:00:49,921 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:49,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:49,921 INFO L85 PathProgramCache]: Analyzing trace with hash 905839350, now seen corresponding path program 89 times [2022-04-28 03:00:49,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:49,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2024249733] [2022-04-28 03:00:51,397 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:00:51,553 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:00:51,554 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash 733327351, now seen corresponding path program 1 times [2022-04-28 03:00:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:51,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415742169] [2022-04-28 03:00:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:51,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:51,560 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:51,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash 905839350, now seen corresponding path program 90 times [2022-04-28 03:00:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:51,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766663171] [2022-04-28 03:00:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:52,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:52,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {23341#(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(12, 2);call #Ultimate.allocInit(12, 3); {23290#true} is VALID [2022-04-28 03:00:52,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {23290#true} assume true; {23290#true} is VALID [2022-04-28 03:00:52,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23290#true} {23290#true} #34#return; {23290#true} is VALID [2022-04-28 03:00:52,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {23290#true} call ULTIMATE.init(); {23341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:52,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {23341#(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(12, 2);call #Ultimate.allocInit(12, 3); {23290#true} is VALID [2022-04-28 03:00:52,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {23290#true} assume true; {23290#true} is VALID [2022-04-28 03:00:52,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23290#true} {23290#true} #34#return; {23290#true} is VALID [2022-04-28 03:00:52,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {23290#true} call #t~ret5 := main(); {23290#true} is VALID [2022-04-28 03:00:52,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {23290#true} ~x~0 := 1;~y~0 := 0; {23295#(= main_~y~0 0)} is VALID [2022-04-28 03:00:52,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {23295#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:00:52,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {23296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:00:52,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {23297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:00:52,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {23298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23299#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:00:52,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {23299#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23300#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:00:52,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {23300#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23301#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:00:52,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {23301#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23302#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:00:52,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {23302#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23303#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:00:52,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {23303#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23304#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:00:52,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {23304#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23305#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:00:52,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {23305#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23306#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:00:52,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {23306#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23307#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:00:52,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {23307#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23308#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:00:52,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {23308#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23309#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:00:52,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {23309#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23310#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:00:52,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {23310#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23311#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:00:52,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {23311#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23312#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:00:52,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {23312#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23313#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:00:52,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {23313#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:00:52,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {23314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23315#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:00:52,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {23315#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23316#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:00:52,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {23316#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23317#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:00:52,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {23317#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23318#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:00:52,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {23318#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23319#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:00:52,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {23319#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23320#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:00:52,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {23320#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23321#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:00:52,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {23321#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23322#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:00:52,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {23322#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23323#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:00:52,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {23323#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23324#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:00:52,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {23324#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23325#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:00:52,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {23325#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23326#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:00:52,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {23326#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23327#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:00:52,723 INFO L290 TraceCheckUtils]: 38: Hoare triple {23327#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23328#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:00:52,723 INFO L290 TraceCheckUtils]: 39: Hoare triple {23328#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23329#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:00:52,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {23329#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23330#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:00:52,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {23330#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23331#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:00:52,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {23331#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23332#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:00:52,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {23332#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23333#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:00:52,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {23333#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23334#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:00:52,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {23334#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23335#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:00:52,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {23335#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23336#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:00:52,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {23336#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23337#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:00:52,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {23337#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23338#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:00:52,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {23338#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23339#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:00:52,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {23339#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23340#(and (<= main_~y~0 45) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:52,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {23340#(and (<= main_~y~0 45) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {23291#false} is VALID [2022-04-28 03:00:52,729 INFO L272 TraceCheckUtils]: 52: Hoare triple {23291#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {23291#false} is VALID [2022-04-28 03:00:52,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {23291#false} ~cond := #in~cond; {23291#false} is VALID [2022-04-28 03:00:52,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {23291#false} assume 0 == ~cond; {23291#false} is VALID [2022-04-28 03:00:52,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {23291#false} assume !false; {23291#false} is VALID [2022-04-28 03:00:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:52,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:52,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766663171] [2022-04-28 03:00:52,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766663171] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:52,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132103772] [2022-04-28 03:00:52,730 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:00:52,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:52,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:52,733 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:00:52,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 03:00:59,058 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2022-04-28 03:00:59,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:59,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 94 conjunts are in the unsatisfiable core [2022-04-28 03:00:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:59,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:59,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {23290#true} call ULTIMATE.init(); {23290#true} is VALID [2022-04-28 03:00:59,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {23290#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(12, 2);call #Ultimate.allocInit(12, 3); {23290#true} is VALID [2022-04-28 03:00:59,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {23290#true} assume true; {23290#true} is VALID [2022-04-28 03:00:59,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23290#true} {23290#true} #34#return; {23290#true} is VALID [2022-04-28 03:00:59,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {23290#true} call #t~ret5 := main(); {23290#true} is VALID [2022-04-28 03:00:59,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {23290#true} ~x~0 := 1;~y~0 := 0; {23295#(= main_~y~0 0)} is VALID [2022-04-28 03:00:59,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {23295#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:00:59,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {23296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:00:59,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {23297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:00:59,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {23298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23299#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:00:59,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {23299#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23300#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:00:59,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {23300#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23301#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:00:59,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {23301#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23302#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:00:59,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {23302#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23303#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:00:59,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {23303#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23304#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:00:59,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {23304#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23305#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:00:59,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {23305#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23306#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:00:59,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {23306#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23307#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:00:59,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {23307#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23308#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:00:59,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {23308#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23309#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:00:59,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {23309#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23310#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:00:59,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {23310#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23311#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:00:59,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {23311#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23312#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:00:59,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {23312#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23313#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:00:59,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {23313#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:00:59,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {23314#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23315#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:00:59,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {23315#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23316#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:00:59,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {23316#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23317#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:00:59,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {23317#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23318#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:00:59,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {23318#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23319#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:00:59,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {23319#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23320#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:00:59,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {23320#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23321#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:00:59,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {23321#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23322#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:00:59,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {23322#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23323#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:00:59,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {23323#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23324#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:00:59,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {23324#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23325#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:00:59,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {23325#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23326#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:00:59,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {23326#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23327#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:00:59,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {23327#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23328#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:00:59,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {23328#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23329#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:00:59,575 INFO L290 TraceCheckUtils]: 40: Hoare triple {23329#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23330#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:00:59,575 INFO L290 TraceCheckUtils]: 41: Hoare triple {23330#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23331#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:00:59,576 INFO L290 TraceCheckUtils]: 42: Hoare triple {23331#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23332#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:00:59,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {23332#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23333#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:00:59,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {23333#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23334#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:00:59,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {23334#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23335#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:00:59,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {23335#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23336#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:00:59,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {23336#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23337#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:00:59,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {23337#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23338#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:00:59,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {23338#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23339#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:00:59,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {23339#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23495#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:00:59,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {23495#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {23291#false} is VALID [2022-04-28 03:00:59,581 INFO L272 TraceCheckUtils]: 52: Hoare triple {23291#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {23291#false} is VALID [2022-04-28 03:00:59,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {23291#false} ~cond := #in~cond; {23291#false} is VALID [2022-04-28 03:00:59,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {23291#false} assume 0 == ~cond; {23291#false} is VALID [2022-04-28 03:00:59,581 INFO L290 TraceCheckUtils]: 55: Hoare triple {23291#false} assume !false; {23291#false} is VALID [2022-04-28 03:00:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:00:59,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:08,374 INFO L290 TraceCheckUtils]: 55: Hoare triple {23291#false} assume !false; {23291#false} is VALID [2022-04-28 03:01:08,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {23291#false} assume 0 == ~cond; {23291#false} is VALID [2022-04-28 03:01:08,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {23291#false} ~cond := #in~cond; {23291#false} is VALID [2022-04-28 03:01:08,374 INFO L272 TraceCheckUtils]: 52: Hoare triple {23291#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {23291#false} is VALID [2022-04-28 03:01:08,374 INFO L290 TraceCheckUtils]: 51: Hoare triple {23523#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {23291#false} is VALID [2022-04-28 03:01:08,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {23527#(or (< (mod (+ main_~y~0 1) 4294967296) 1024) (not (< (mod main_~y~0 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23523#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:01:08,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {23531#(or (< (mod (+ main_~y~0 2) 4294967296) 1024) (not (< (mod (+ main_~y~0 1) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23527#(or (< (mod (+ main_~y~0 1) 4294967296) 1024) (not (< (mod main_~y~0 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,377 INFO L290 TraceCheckUtils]: 48: Hoare triple {23535#(or (< (mod (+ main_~y~0 3) 4294967296) 1024) (not (< (mod (+ main_~y~0 2) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23531#(or (< (mod (+ main_~y~0 2) 4294967296) 1024) (not (< (mod (+ main_~y~0 1) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,378 INFO L290 TraceCheckUtils]: 47: Hoare triple {23539#(or (not (< (mod (+ main_~y~0 3) 4294967296) 1024)) (< (mod (+ main_~y~0 4) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23535#(or (< (mod (+ main_~y~0 3) 4294967296) 1024) (not (< (mod (+ main_~y~0 2) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,380 INFO L290 TraceCheckUtils]: 46: Hoare triple {23543#(or (not (< (mod (+ main_~y~0 4) 4294967296) 1024)) (< (mod (+ 5 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23539#(or (not (< (mod (+ main_~y~0 3) 4294967296) 1024)) (< (mod (+ main_~y~0 4) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {23547#(or (not (< (mod (+ 5 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 6) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23543#(or (not (< (mod (+ main_~y~0 4) 4294967296) 1024)) (< (mod (+ 5 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {23551#(or (< (mod (+ 7 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 6) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23547#(or (not (< (mod (+ 5 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 6) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {23555#(or (not (< (mod (+ 7 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 8) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23551#(or (< (mod (+ 7 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 6) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {23559#(or (< (mod (+ main_~y~0 9) 4294967296) 1024) (not (< (mod (+ main_~y~0 8) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23555#(or (not (< (mod (+ 7 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 8) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {23563#(or (not (< (mod (+ main_~y~0 9) 4294967296) 1024)) (< (mod (+ main_~y~0 10) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23559#(or (< (mod (+ main_~y~0 9) 4294967296) 1024) (not (< (mod (+ main_~y~0 8) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {23567#(or (not (< (mod (+ main_~y~0 10) 4294967296) 1024)) (< (mod (+ main_~y~0 11) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23563#(or (not (< (mod (+ main_~y~0 9) 4294967296) 1024)) (< (mod (+ main_~y~0 10) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {23571#(or (not (< (mod (+ main_~y~0 11) 4294967296) 1024)) (< (mod (+ main_~y~0 12) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23567#(or (not (< (mod (+ main_~y~0 10) 4294967296) 1024)) (< (mod (+ main_~y~0 11) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {23575#(or (not (< (mod (+ main_~y~0 12) 4294967296) 1024)) (< (mod (+ main_~y~0 13) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23571#(or (not (< (mod (+ main_~y~0 11) 4294967296) 1024)) (< (mod (+ main_~y~0 12) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {23579#(or (< (mod (+ main_~y~0 14) 4294967296) 1024) (not (< (mod (+ main_~y~0 13) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23575#(or (not (< (mod (+ main_~y~0 12) 4294967296) 1024)) (< (mod (+ main_~y~0 13) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {23583#(or (not (< (mod (+ main_~y~0 14) 4294967296) 1024)) (< (mod (+ main_~y~0 15) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23579#(or (< (mod (+ main_~y~0 14) 4294967296) 1024) (not (< (mod (+ main_~y~0 13) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {23587#(or (< (mod (+ main_~y~0 16) 4294967296) 1024) (not (< (mod (+ main_~y~0 15) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23583#(or (not (< (mod (+ main_~y~0 14) 4294967296) 1024)) (< (mod (+ main_~y~0 15) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {23591#(or (< (mod (+ main_~y~0 17) 4294967296) 1024) (not (< (mod (+ main_~y~0 16) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23587#(or (< (mod (+ main_~y~0 16) 4294967296) 1024) (not (< (mod (+ main_~y~0 15) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {23595#(or (< (mod (+ main_~y~0 18) 4294967296) 1024) (not (< (mod (+ main_~y~0 17) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23591#(or (< (mod (+ main_~y~0 17) 4294967296) 1024) (not (< (mod (+ main_~y~0 16) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {23599#(or (not (< (mod (+ main_~y~0 18) 4294967296) 1024)) (< (mod (+ 19 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23595#(or (< (mod (+ main_~y~0 18) 4294967296) 1024) (not (< (mod (+ main_~y~0 17) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {23603#(or (< (mod (+ main_~y~0 20) 4294967296) 1024) (not (< (mod (+ 19 main_~y~0) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23599#(or (not (< (mod (+ main_~y~0 18) 4294967296) 1024)) (< (mod (+ 19 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {23607#(or (< (mod (+ main_~y~0 21) 4294967296) 1024) (not (< (mod (+ main_~y~0 20) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23603#(or (< (mod (+ main_~y~0 20) 4294967296) 1024) (not (< (mod (+ 19 main_~y~0) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {23611#(or (< (mod (+ main_~y~0 22) 4294967296) 1024) (not (< (mod (+ main_~y~0 21) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23607#(or (< (mod (+ main_~y~0 21) 4294967296) 1024) (not (< (mod (+ main_~y~0 20) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {23615#(or (not (< (mod (+ main_~y~0 22) 4294967296) 1024)) (< (mod (+ 23 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23611#(or (< (mod (+ main_~y~0 22) 4294967296) 1024) (not (< (mod (+ main_~y~0 21) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {23619#(or (not (< (mod (+ 23 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 24) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23615#(or (not (< (mod (+ main_~y~0 22) 4294967296) 1024)) (< (mod (+ 23 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {23623#(or (not (< (mod (+ main_~y~0 24) 4294967296) 1024)) (< (mod (+ main_~y~0 25) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23619#(or (not (< (mod (+ 23 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 24) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {23627#(or (< (mod (+ main_~y~0 26) 4294967296) 1024) (not (< (mod (+ main_~y~0 25) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23623#(or (not (< (mod (+ main_~y~0 24) 4294967296) 1024)) (< (mod (+ main_~y~0 25) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {23631#(or (< (mod (+ main_~y~0 27) 4294967296) 1024) (not (< (mod (+ main_~y~0 26) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23627#(or (< (mod (+ main_~y~0 26) 4294967296) 1024) (not (< (mod (+ main_~y~0 25) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {23635#(or (< (mod (+ main_~y~0 28) 4294967296) 1024) (not (< (mod (+ main_~y~0 27) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23631#(or (< (mod (+ main_~y~0 27) 4294967296) 1024) (not (< (mod (+ main_~y~0 26) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {23639#(or (not (< (mod (+ main_~y~0 28) 4294967296) 1024)) (< (mod (+ 29 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23635#(or (< (mod (+ main_~y~0 28) 4294967296) 1024) (not (< (mod (+ main_~y~0 27) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {23643#(or (< (mod (+ 30 main_~y~0) 4294967296) 1024) (not (< (mod (+ 29 main_~y~0) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23639#(or (not (< (mod (+ main_~y~0 28) 4294967296) 1024)) (< (mod (+ 29 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {23647#(or (not (< (mod (+ 30 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 31) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23643#(or (< (mod (+ 30 main_~y~0) 4294967296) 1024) (not (< (mod (+ 29 main_~y~0) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {23651#(or (< (mod (+ 32 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 31) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23647#(or (not (< (mod (+ 30 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 31) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {23655#(or (not (< (mod (+ 32 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 33) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23651#(or (< (mod (+ 32 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 31) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {23659#(or (< (mod (+ main_~y~0 34) 4294967296) 1024) (not (< (mod (+ main_~y~0 33) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23655#(or (not (< (mod (+ 32 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 33) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {23663#(or (< (mod (+ 35 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 34) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23659#(or (< (mod (+ main_~y~0 34) 4294967296) 1024) (not (< (mod (+ main_~y~0 33) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {23667#(or (not (< (mod (+ 35 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 36) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23663#(or (< (mod (+ 35 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 34) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {23671#(or (< (mod (+ main_~y~0 37) 4294967296) 1024) (not (< (mod (+ main_~y~0 36) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23667#(or (not (< (mod (+ 35 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 36) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {23675#(or (not (< (mod (+ main_~y~0 37) 4294967296) 1024)) (< (mod (+ main_~y~0 38) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23671#(or (< (mod (+ main_~y~0 37) 4294967296) 1024) (not (< (mod (+ main_~y~0 36) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {23679#(or (not (< (mod (+ main_~y~0 38) 4294967296) 1024)) (< (mod (+ main_~y~0 39) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23675#(or (not (< (mod (+ main_~y~0 37) 4294967296) 1024)) (< (mod (+ main_~y~0 38) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {23683#(or (< (mod (+ 40 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 39) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23679#(or (not (< (mod (+ main_~y~0 38) 4294967296) 1024)) (< (mod (+ main_~y~0 39) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {23687#(or (< (mod (+ 41 main_~y~0) 4294967296) 1024) (not (< (mod (+ 40 main_~y~0) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23683#(or (< (mod (+ 40 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 39) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {23691#(or (not (< (mod (+ 41 main_~y~0) 4294967296) 1024)) (< (mod (+ 42 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23687#(or (< (mod (+ 41 main_~y~0) 4294967296) 1024) (not (< (mod (+ 40 main_~y~0) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {23695#(or (< (mod (+ main_~y~0 43) 4294967296) 1024) (not (< (mod (+ 42 main_~y~0) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23691#(or (not (< (mod (+ 41 main_~y~0) 4294967296) 1024)) (< (mod (+ 42 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {23699#(or (not (< (mod (+ main_~y~0 43) 4294967296) 1024)) (< (mod (+ 44 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23695#(or (< (mod (+ main_~y~0 43) 4294967296) 1024) (not (< (mod (+ 42 main_~y~0) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {23703#(or (< (mod (+ main_~y~0 45) 4294967296) 1024) (not (< (mod (+ 44 main_~y~0) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {23699#(or (not (< (mod (+ main_~y~0 43) 4294967296) 1024)) (< (mod (+ 44 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:01:08,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {23290#true} ~x~0 := 1;~y~0 := 0; {23703#(or (< (mod (+ main_~y~0 45) 4294967296) 1024) (not (< (mod (+ 44 main_~y~0) 4294967296) 1024)))} is VALID [2022-04-28 03:01:08,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {23290#true} call #t~ret5 := main(); {23290#true} is VALID [2022-04-28 03:01:08,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23290#true} {23290#true} #34#return; {23290#true} is VALID [2022-04-28 03:01:08,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {23290#true} assume true; {23290#true} is VALID [2022-04-28 03:01:08,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {23290#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(12, 2);call #Ultimate.allocInit(12, 3); {23290#true} is VALID [2022-04-28 03:01:08,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {23290#true} call ULTIMATE.init(); {23290#true} is VALID [2022-04-28 03:01:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:08,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132103772] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:08,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:08,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-28 03:01:08,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:08,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2024249733] [2022-04-28 03:01:08,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2024249733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:08,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:08,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 03:01:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366793573] [2022-04-28 03:01:08,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:08,415 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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 56 [2022-04-28 03:01:08,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:08,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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-28 03:01:08,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:08,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 03:01:08,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:08,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 03:01:08,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2397, Invalid=6723, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 03:01:08,448 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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-28 03:01:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:12,644 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 03:01:12,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 03:01:12,644 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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 56 [2022-04-28 03:01:12,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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-28 03:01:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-28 03:01:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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-28 03:01:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-28 03:01:12,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 63 transitions. [2022-04-28 03:01:12,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:12,684 INFO L225 Difference]: With dead ends: 63 [2022-04-28 03:01:12,684 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 03:01:12,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=4787, Invalid=15235, Unknown=0, NotChecked=0, Total=20022 [2022-04-28 03:01:12,686 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:12,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 03:01:12,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 03:01:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-28 03:01:12,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:12,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 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-28 03:01:12,745 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 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-28 03:01:12,745 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 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-28 03:01:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:12,746 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 03:01:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 03:01:12,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:12,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:12,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 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 58 states. [2022-04-28 03:01:12,746 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 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 58 states. [2022-04-28 03:01:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:12,747 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 03:01:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 03:01:12,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:12,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:12,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:12,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:12,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 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-28 03:01:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-28 03:01:12,748 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2022-04-28 03:01:12,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:12,748 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-28 03:01:12,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 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-28 03:01:12,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 58 transitions. [2022-04-28 03:01:12,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 03:01:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 03:01:12,804 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:12,804 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:12,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:13,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:13,005 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 91 times [2022-04-28 03:01:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:13,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1081126886] [2022-04-28 03:01:13,325 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:01:13,326 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash 792432695, now seen corresponding path program 1 times [2022-04-28 03:01:13,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:13,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947568052] [2022-04-28 03:01:13,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:13,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:13,335 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:13,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 92 times [2022-04-28 03:01:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:13,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696688348] [2022-04-28 03:01:13,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:13,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:14,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:14,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {24226#(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(12, 2);call #Ultimate.allocInit(12, 3); {24174#true} is VALID [2022-04-28 03:01:14,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {24174#true} assume true; {24174#true} is VALID [2022-04-28 03:01:14,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24174#true} {24174#true} #34#return; {24174#true} is VALID [2022-04-28 03:01:14,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {24174#true} call ULTIMATE.init(); {24226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:14,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {24226#(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(12, 2);call #Ultimate.allocInit(12, 3); {24174#true} is VALID [2022-04-28 03:01:14,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {24174#true} assume true; {24174#true} is VALID [2022-04-28 03:01:14,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24174#true} {24174#true} #34#return; {24174#true} is VALID [2022-04-28 03:01:14,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {24174#true} call #t~ret5 := main(); {24174#true} is VALID [2022-04-28 03:01:14,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {24174#true} ~x~0 := 1;~y~0 := 0; {24179#(= main_~y~0 0)} is VALID [2022-04-28 03:01:14,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {24179#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24180#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:01:14,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {24180#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24181#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:01:14,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {24181#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24182#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:01:14,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {24182#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24183#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:01:14,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {24183#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24184#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:01:14,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {24184#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24185#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:01:14,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {24185#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24186#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:01:14,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {24186#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24187#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:01:14,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {24187#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24188#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:01:14,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {24188#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24189#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:01:14,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {24189#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24190#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:01:14,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {24190#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24191#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:01:14,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {24191#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24192#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:01:14,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {24192#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24193#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:01:14,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {24193#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24194#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:01:14,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {24194#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24195#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:01:14,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {24195#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24196#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:01:14,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {24196#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24197#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:01:14,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {24197#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24198#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:01:14,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {24198#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24199#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:01:14,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {24199#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24200#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:01:14,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {24200#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24201#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:01:14,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {24201#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24202#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:01:14,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {24202#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24203#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:01:14,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {24203#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24204#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:01:14,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {24204#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24205#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:01:14,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {24205#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24206#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:01:14,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {24206#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24207#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:01:14,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {24207#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24208#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:01:14,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {24208#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24209#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:01:14,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {24209#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24210#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:01:14,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {24210#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24211#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:01:14,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {24211#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24212#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:01:14,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {24212#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24213#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:01:14,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {24213#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24214#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:01:14,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {24214#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24215#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:01:14,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {24215#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24216#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:01:14,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {24216#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24217#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:01:14,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {24217#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24218#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:01:14,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {24218#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24219#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:01:14,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {24219#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24220#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:01:14,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {24220#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24221#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:01:14,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {24221#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24222#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:01:14,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {24222#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24223#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:01:14,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {24223#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24224#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:01:14,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {24224#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24225#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 46))} is VALID [2022-04-28 03:01:14,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {24225#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 46))} assume !(~y~0 % 4294967296 < 1024); {24175#false} is VALID [2022-04-28 03:01:14,502 INFO L272 TraceCheckUtils]: 53: Hoare triple {24175#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {24175#false} is VALID [2022-04-28 03:01:14,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {24175#false} ~cond := #in~cond; {24175#false} is VALID [2022-04-28 03:01:14,502 INFO L290 TraceCheckUtils]: 55: Hoare triple {24175#false} assume 0 == ~cond; {24175#false} is VALID [2022-04-28 03:01:14,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {24175#false} assume !false; {24175#false} is VALID [2022-04-28 03:01:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:14,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:14,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696688348] [2022-04-28 03:01:14,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696688348] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:14,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231993722] [2022-04-28 03:01:14,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:01:14,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:14,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:14,504 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:14,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 03:01:14,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:01:14,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:14,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-28 03:01:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:14,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:15,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {24174#true} call ULTIMATE.init(); {24174#true} is VALID [2022-04-28 03:01:15,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {24174#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(12, 2);call #Ultimate.allocInit(12, 3); {24174#true} is VALID [2022-04-28 03:01:15,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {24174#true} assume true; {24174#true} is VALID [2022-04-28 03:01:15,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24174#true} {24174#true} #34#return; {24174#true} is VALID [2022-04-28 03:01:15,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {24174#true} call #t~ret5 := main(); {24174#true} is VALID [2022-04-28 03:01:15,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {24174#true} ~x~0 := 1;~y~0 := 0; {24179#(= main_~y~0 0)} is VALID [2022-04-28 03:01:15,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {24179#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24180#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:01:15,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {24180#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24181#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:01:15,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {24181#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24182#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:01:15,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {24182#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24183#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:01:15,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {24183#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24184#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:01:15,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {24184#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24185#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:01:15,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {24185#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24186#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:01:15,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {24186#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24187#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:01:15,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {24187#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24188#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:01:15,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {24188#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24189#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:01:15,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {24189#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24190#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:01:15,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {24190#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24191#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:01:15,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {24191#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24192#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:01:15,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {24192#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24193#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:01:15,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {24193#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24194#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:01:15,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {24194#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24195#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:01:15,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {24195#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24196#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:01:15,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {24196#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24197#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:01:15,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {24197#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24198#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:01:15,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {24198#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24199#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:01:15,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {24199#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24200#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:01:15,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {24200#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24201#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:01:15,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {24201#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24202#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:01:15,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {24202#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24203#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:01:15,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {24203#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24204#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:01:15,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {24204#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24205#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:01:15,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {24205#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24206#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:01:15,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {24206#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24207#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:01:15,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {24207#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24208#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:01:15,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {24208#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24209#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:01:15,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {24209#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24210#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:01:15,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {24210#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24211#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:01:15,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {24211#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24212#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:01:15,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {24212#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24213#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:01:15,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {24213#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24214#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:01:15,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {24214#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24215#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:01:15,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {24215#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24216#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:01:15,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {24216#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24217#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:01:15,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {24217#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24218#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:01:15,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {24218#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24219#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:01:15,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {24219#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24220#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:01:15,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {24220#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24221#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:01:15,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {24221#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24222#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:01:15,172 INFO L290 TraceCheckUtils]: 49: Hoare triple {24222#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24223#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:01:15,172 INFO L290 TraceCheckUtils]: 50: Hoare triple {24223#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24224#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:01:15,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {24224#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24383#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:01:15,173 INFO L290 TraceCheckUtils]: 52: Hoare triple {24383#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {24175#false} is VALID [2022-04-28 03:01:15,173 INFO L272 TraceCheckUtils]: 53: Hoare triple {24175#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {24175#false} is VALID [2022-04-28 03:01:15,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {24175#false} ~cond := #in~cond; {24175#false} is VALID [2022-04-28 03:01:15,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {24175#false} assume 0 == ~cond; {24175#false} is VALID [2022-04-28 03:01:15,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {24175#false} assume !false; {24175#false} is VALID [2022-04-28 03:01:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:15,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:18,434 INFO L290 TraceCheckUtils]: 56: Hoare triple {24175#false} assume !false; {24175#false} is VALID [2022-04-28 03:01:18,435 INFO L290 TraceCheckUtils]: 55: Hoare triple {24175#false} assume 0 == ~cond; {24175#false} is VALID [2022-04-28 03:01:18,435 INFO L290 TraceCheckUtils]: 54: Hoare triple {24175#false} ~cond := #in~cond; {24175#false} is VALID [2022-04-28 03:01:18,435 INFO L272 TraceCheckUtils]: 53: Hoare triple {24175#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {24175#false} is VALID [2022-04-28 03:01:18,435 INFO L290 TraceCheckUtils]: 52: Hoare triple {24411#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {24175#false} is VALID [2022-04-28 03:01:18,436 INFO L290 TraceCheckUtils]: 51: Hoare triple {24415#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24411#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:01:18,437 INFO L290 TraceCheckUtils]: 50: Hoare triple {24419#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24415#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {24423#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24419#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {24427#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24423#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {24431#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24427#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {24435#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24431#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {24439#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24435#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {24443#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24439#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {24447#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24443#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {24451#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24447#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {24455#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24451#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {24459#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24455#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {24463#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24459#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {24467#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24463#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {24471#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24467#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {24475#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24471#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {24479#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24475#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {24483#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24479#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {24487#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24483#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {24491#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24487#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {24495#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24491#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {24499#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24495#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {24503#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24499#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {24507#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24503#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {24511#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24507#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {24515#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24511#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {24519#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24515#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {24523#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24519#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {24527#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24523#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {24531#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24527#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {24535#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24531#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {24539#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24535#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {24543#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24539#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {24547#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24543#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {24551#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24547#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {24555#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24551#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {24559#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24555#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {24563#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24559#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {24567#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24563#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {24571#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24567#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {24575#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24571#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {24579#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24575#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {24583#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24579#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {24587#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24583#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {24591#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24587#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {24595#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {24591#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {24174#true} ~x~0 := 1;~y~0 := 0; {24595#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:01:18,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {24174#true} call #t~ret5 := main(); {24174#true} is VALID [2022-04-28 03:01:18,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24174#true} {24174#true} #34#return; {24174#true} is VALID [2022-04-28 03:01:18,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {24174#true} assume true; {24174#true} is VALID [2022-04-28 03:01:18,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {24174#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(12, 2);call #Ultimate.allocInit(12, 3); {24174#true} is VALID [2022-04-28 03:01:18,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {24174#true} call ULTIMATE.init(); {24174#true} is VALID [2022-04-28 03:01:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:18,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231993722] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:18,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:18,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-28 03:01:18,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:18,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1081126886] [2022-04-28 03:01:18,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1081126886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:18,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:18,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 03:01:18,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876692183] [2022-04-28 03:01:18,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:18,472 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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 57 [2022-04-28 03:01:18,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:18,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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-28 03:01:18,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:18,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 03:01:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:18,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 03:01:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 03:01:18,503 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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-28 03:01:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:22,710 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 03:01:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 03:01:22,711 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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 57 [2022-04-28 03:01:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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-28 03:01:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 03:01:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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-28 03:01:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 03:01:22,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-28 03:01:22,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:22,749 INFO L225 Difference]: With dead ends: 64 [2022-04-28 03:01:22,749 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 03:01:22,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4985, Invalid=15895, Unknown=0, NotChecked=0, Total=20880 [2022-04-28 03:01:22,750 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:22,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 03:01:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 03:01:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 03:01:22,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:22,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 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-28 03:01:22,805 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 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-28 03:01:22,805 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 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-28 03:01:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:22,806 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 03:01:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 03:01:22,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:22,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:22,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 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 59 states. [2022-04-28 03:01:22,806 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 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 59 states. [2022-04-28 03:01:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:22,807 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 03:01:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 03:01:22,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:22,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:22,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:22,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:22,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 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-28 03:01:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-28 03:01:22,808 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2022-04-28 03:01:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:22,808 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-28 03:01:22,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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-28 03:01:22,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-28 03:01:22,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 03:01:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 03:01:22,853 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:22,853 INFO L195 NwaCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:22,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:23,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:23,053 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:23,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash -199985226, now seen corresponding path program 93 times [2022-04-28 03:01:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:23,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1120391072] [2022-04-28 03:01:24,184 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:01:24,343 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:01:24,344 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:24,346 INFO L85 PathProgramCache]: Analyzing trace with hash 851538039, now seen corresponding path program 1 times [2022-04-28 03:01:24,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:24,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184042107] [2022-04-28 03:01:24,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:24,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:24,350 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:24,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash -199985226, now seen corresponding path program 94 times [2022-04-28 03:01:24,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:24,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774696275] [2022-04-28 03:01:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:25,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:25,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {25127#(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(12, 2);call #Ultimate.allocInit(12, 3); {25074#true} is VALID [2022-04-28 03:01:25,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {25074#true} assume true; {25074#true} is VALID [2022-04-28 03:01:25,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25074#true} {25074#true} #34#return; {25074#true} is VALID [2022-04-28 03:01:25,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {25074#true} call ULTIMATE.init(); {25127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:25,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {25127#(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(12, 2);call #Ultimate.allocInit(12, 3); {25074#true} is VALID [2022-04-28 03:01:25,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {25074#true} assume true; {25074#true} is VALID [2022-04-28 03:01:25,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25074#true} {25074#true} #34#return; {25074#true} is VALID [2022-04-28 03:01:25,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {25074#true} call #t~ret5 := main(); {25074#true} is VALID [2022-04-28 03:01:25,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {25074#true} ~x~0 := 1;~y~0 := 0; {25079#(= main_~y~0 0)} is VALID [2022-04-28 03:01:25,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {25079#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:01:25,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {25080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:01:25,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {25081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:01:25,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {25082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:01:25,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {25083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:01:25,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {25084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:01:25,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {25085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25086#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:01:25,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {25086#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25087#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:01:25,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {25087#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:01:25,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {25088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25089#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:01:25,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {25089#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25090#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:01:25,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {25090#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25091#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:01:25,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {25091#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25092#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:01:25,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {25092#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25093#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:01:25,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {25093#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25094#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:01:25,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {25094#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25095#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:01:25,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {25095#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25096#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:01:25,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {25096#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25097#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:01:25,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {25097#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25098#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:01:25,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {25098#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25099#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:01:25,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {25099#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25100#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:01:25,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {25100#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25101#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:01:25,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {25101#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25102#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:01:25,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {25102#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25103#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:01:25,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {25103#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25104#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:01:25,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {25104#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25105#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:01:25,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {25105#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25106#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:01:25,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {25106#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25107#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:01:25,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {25107#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25108#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:01:25,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {25108#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25109#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:01:25,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {25109#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25110#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:01:25,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {25110#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25111#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:01:25,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {25111#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25112#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:01:25,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {25112#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25113#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:01:25,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {25113#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25114#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:01:25,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {25114#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25115#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:01:25,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {25115#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25116#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:01:25,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {25116#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25117#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:01:25,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {25117#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25118#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:01:25,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {25118#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25119#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:01:25,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {25119#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25120#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:01:25,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {25120#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25121#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:01:25,598 INFO L290 TraceCheckUtils]: 48: Hoare triple {25121#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25122#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:01:25,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {25122#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25123#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:01:25,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {25123#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25124#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:01:25,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {25124#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25125#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:01:25,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {25125#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25126#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 47))} is VALID [2022-04-28 03:01:25,600 INFO L290 TraceCheckUtils]: 53: Hoare triple {25126#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 47))} assume !(~y~0 % 4294967296 < 1024); {25075#false} is VALID [2022-04-28 03:01:25,600 INFO L272 TraceCheckUtils]: 54: Hoare triple {25075#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {25075#false} is VALID [2022-04-28 03:01:25,600 INFO L290 TraceCheckUtils]: 55: Hoare triple {25075#false} ~cond := #in~cond; {25075#false} is VALID [2022-04-28 03:01:25,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {25075#false} assume 0 == ~cond; {25075#false} is VALID [2022-04-28 03:01:25,601 INFO L290 TraceCheckUtils]: 57: Hoare triple {25075#false} assume !false; {25075#false} is VALID [2022-04-28 03:01:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:25,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:25,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774696275] [2022-04-28 03:01:25,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774696275] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:25,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097116120] [2022-04-28 03:01:25,601 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:01:25,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:25,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:25,602 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:25,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 03:01:25,724 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:01:25,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:25,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-28 03:01:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:25,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:26,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {25074#true} call ULTIMATE.init(); {25074#true} is VALID [2022-04-28 03:01:26,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {25074#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(12, 2);call #Ultimate.allocInit(12, 3); {25074#true} is VALID [2022-04-28 03:01:26,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {25074#true} assume true; {25074#true} is VALID [2022-04-28 03:01:26,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25074#true} {25074#true} #34#return; {25074#true} is VALID [2022-04-28 03:01:26,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {25074#true} call #t~ret5 := main(); {25074#true} is VALID [2022-04-28 03:01:26,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {25074#true} ~x~0 := 1;~y~0 := 0; {25079#(= main_~y~0 0)} is VALID [2022-04-28 03:01:26,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {25079#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:01:26,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {25080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:01:26,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {25081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:01:26,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {25082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:01:26,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {25083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:01:26,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {25084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:01:26,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {25085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25086#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:01:26,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {25086#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25087#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:01:26,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {25087#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:01:26,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {25088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25089#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:01:26,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {25089#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25090#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:01:26,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {25090#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25091#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:01:26,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {25091#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25092#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:01:26,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {25092#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25093#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:01:26,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {25093#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25094#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:01:26,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {25094#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25095#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:01:26,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {25095#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25096#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:01:26,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {25096#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25097#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:01:26,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {25097#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25098#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:01:26,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {25098#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25099#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:01:26,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {25099#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25100#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:01:26,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {25100#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25101#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:01:26,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {25101#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25102#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:01:26,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {25102#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25103#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:01:26,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {25103#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25104#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:01:26,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {25104#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25105#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:01:26,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {25105#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25106#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:01:26,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {25106#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25107#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:01:26,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {25107#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25108#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:01:26,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {25108#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25109#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:01:26,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {25109#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25110#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:01:26,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {25110#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25111#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:01:26,339 INFO L290 TraceCheckUtils]: 38: Hoare triple {25111#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25112#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:01:26,340 INFO L290 TraceCheckUtils]: 39: Hoare triple {25112#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25113#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:01:26,340 INFO L290 TraceCheckUtils]: 40: Hoare triple {25113#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25114#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:01:26,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {25114#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25115#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:01:26,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {25115#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25116#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:01:26,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {25116#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25117#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:01:26,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {25117#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25118#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:01:26,343 INFO L290 TraceCheckUtils]: 45: Hoare triple {25118#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25119#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:01:26,343 INFO L290 TraceCheckUtils]: 46: Hoare triple {25119#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25120#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:01:26,344 INFO L290 TraceCheckUtils]: 47: Hoare triple {25120#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25121#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:01:26,344 INFO L290 TraceCheckUtils]: 48: Hoare triple {25121#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25122#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:01:26,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {25122#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25123#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:01:26,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {25123#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25124#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:01:26,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {25124#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25125#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:01:26,346 INFO L290 TraceCheckUtils]: 52: Hoare triple {25125#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25287#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:01:26,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {25287#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {25075#false} is VALID [2022-04-28 03:01:26,346 INFO L272 TraceCheckUtils]: 54: Hoare triple {25075#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {25075#false} is VALID [2022-04-28 03:01:26,347 INFO L290 TraceCheckUtils]: 55: Hoare triple {25075#false} ~cond := #in~cond; {25075#false} is VALID [2022-04-28 03:01:26,347 INFO L290 TraceCheckUtils]: 56: Hoare triple {25075#false} assume 0 == ~cond; {25075#false} is VALID [2022-04-28 03:01:26,347 INFO L290 TraceCheckUtils]: 57: Hoare triple {25075#false} assume !false; {25075#false} is VALID [2022-04-28 03:01:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:26,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:29,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {25075#false} assume !false; {25075#false} is VALID [2022-04-28 03:01:29,959 INFO L290 TraceCheckUtils]: 56: Hoare triple {25075#false} assume 0 == ~cond; {25075#false} is VALID [2022-04-28 03:01:29,959 INFO L290 TraceCheckUtils]: 55: Hoare triple {25075#false} ~cond := #in~cond; {25075#false} is VALID [2022-04-28 03:01:29,959 INFO L272 TraceCheckUtils]: 54: Hoare triple {25075#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {25075#false} is VALID [2022-04-28 03:01:29,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {25315#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {25075#false} is VALID [2022-04-28 03:01:29,960 INFO L290 TraceCheckUtils]: 52: Hoare triple {25319#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25315#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:01:29,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {25323#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25319#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,961 INFO L290 TraceCheckUtils]: 50: Hoare triple {25327#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25323#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {25331#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25327#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {25335#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25331#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,963 INFO L290 TraceCheckUtils]: 47: Hoare triple {25339#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25335#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,964 INFO L290 TraceCheckUtils]: 46: Hoare triple {25343#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25339#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,964 INFO L290 TraceCheckUtils]: 45: Hoare triple {25347#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25343#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,965 INFO L290 TraceCheckUtils]: 44: Hoare triple {25351#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25347#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {25355#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25351#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {25359#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25355#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {25363#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25359#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,967 INFO L290 TraceCheckUtils]: 40: Hoare triple {25367#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25363#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,968 INFO L290 TraceCheckUtils]: 39: Hoare triple {25371#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25367#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {25375#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25371#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {25379#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25375#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {25383#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25379#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {25387#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25383#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {25391#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25387#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {25395#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25391#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {25399#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25395#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {25403#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25399#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {25407#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25403#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {25411#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25407#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {25415#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25411#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {25419#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25415#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {25423#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25419#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {25427#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25423#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {25431#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25427#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {25435#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25431#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {25439#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25435#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {25443#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25439#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {25447#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25443#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {25451#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25447#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {25455#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25451#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {25459#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25455#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {25463#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25459#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {25467#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25463#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {25471#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25467#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {25475#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25471#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {25479#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25475#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {25483#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25479#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {25487#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25483#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {25491#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25487#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {25495#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25491#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {25499#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25495#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {25503#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25499#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {25074#true} ~x~0 := 1;~y~0 := 0; {25503#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:01:29,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {25074#true} call #t~ret5 := main(); {25074#true} is VALID [2022-04-28 03:01:29,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25074#true} {25074#true} #34#return; {25074#true} is VALID [2022-04-28 03:01:29,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {25074#true} assume true; {25074#true} is VALID [2022-04-28 03:01:29,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {25074#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(12, 2);call #Ultimate.allocInit(12, 3); {25074#true} is VALID [2022-04-28 03:01:29,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {25074#true} call ULTIMATE.init(); {25074#true} is VALID [2022-04-28 03:01:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:29,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097116120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:29,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:30,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 100 [2022-04-28 03:01:30,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:30,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1120391072] [2022-04-28 03:01:30,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1120391072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:30,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:30,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 03:01:30,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112531913] [2022-04-28 03:01:30,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:30,000 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 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 58 [2022-04-28 03:01:30,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:30,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 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-28 03:01:30,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:30,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 03:01:30,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:30,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 03:01:30,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2597, Invalid=7303, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 03:01:30,032 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 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-28 03:01:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:34,668 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 03:01:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 03:01:34,671 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 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 58 [2022-04-28 03:01:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 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-28 03:01:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-28 03:01:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 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-28 03:01:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-28 03:01:34,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 65 transitions. [2022-04-28 03:01:34,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:34,715 INFO L225 Difference]: With dead ends: 65 [2022-04-28 03:01:34,715 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 03:01:34,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5187, Invalid=16569, Unknown=0, NotChecked=0, Total=21756 [2022-04-28 03:01:34,717 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:34,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 2480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:01:34,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 03:01:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 03:01:34,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:34,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 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-28 03:01:34,793 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 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-28 03:01:34,794 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 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-28 03:01:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:34,795 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 03:01:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 03:01:34,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:34,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:34,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 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 60 states. [2022-04-28 03:01:34,795 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 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 60 states. [2022-04-28 03:01:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:34,796 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 03:01:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 03:01:34,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:34,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:34,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:34,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 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-28 03:01:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2022-04-28 03:01:34,796 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2022-04-28 03:01:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:34,797 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2022-04-28 03:01:34,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 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-28 03:01:34,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 60 transitions. [2022-04-28 03:01:34,841 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-28 03:01:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 03:01:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 03:01:34,841 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:34,841 INFO L195 NwaCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:34,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:35,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:35,047 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:35,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1868113444, now seen corresponding path program 95 times [2022-04-28 03:01:35,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:35,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [133611665] [2022-04-28 03:01:36,211 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:01:36,369 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:01:36,370 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:36,372 INFO L85 PathProgramCache]: Analyzing trace with hash 910643383, now seen corresponding path program 1 times [2022-04-28 03:01:36,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:36,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167303468] [2022-04-28 03:01:36,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:36,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:36,378 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:36,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:36,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1868113444, now seen corresponding path program 96 times [2022-04-28 03:01:36,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:36,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46220304] [2022-04-28 03:01:36,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:36,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:37,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:37,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {26044#(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(12, 2);call #Ultimate.allocInit(12, 3); {25990#true} is VALID [2022-04-28 03:01:37,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {25990#true} assume true; {25990#true} is VALID [2022-04-28 03:01:37,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25990#true} {25990#true} #34#return; {25990#true} is VALID [2022-04-28 03:01:37,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {25990#true} call ULTIMATE.init(); {26044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:37,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {26044#(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(12, 2);call #Ultimate.allocInit(12, 3); {25990#true} is VALID [2022-04-28 03:01:37,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {25990#true} assume true; {25990#true} is VALID [2022-04-28 03:01:37,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25990#true} {25990#true} #34#return; {25990#true} is VALID [2022-04-28 03:01:37,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {25990#true} call #t~ret5 := main(); {25990#true} is VALID [2022-04-28 03:01:37,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {25990#true} ~x~0 := 1;~y~0 := 0; {25995#(= main_~y~0 0)} is VALID [2022-04-28 03:01:37,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {25995#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:01:37,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {25996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:01:37,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {25997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:01:37,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {25998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:01:37,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {25999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:01:37,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {26000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:01:37,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {26001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:01:37,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {26002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:01:37,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {26003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:01:37,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {26004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:01:37,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {26005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:01:37,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {26006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:01:37,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {26007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:01:37,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {26008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:01:37,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {26009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:01:37,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {26010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:01:37,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {26011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26012#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:01:37,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {26012#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26013#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:01:37,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {26013#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26014#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:01:37,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {26014#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26015#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:01:37,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {26015#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26016#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:01:37,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {26016#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26017#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:01:37,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {26017#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26018#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:01:37,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {26018#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26019#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:01:37,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {26019#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26020#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:01:37,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {26020#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26021#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:01:37,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {26021#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26022#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:01:37,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {26022#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26023#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:01:37,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {26023#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26024#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:01:37,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {26024#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26025#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:01:37,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {26025#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26026#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:01:37,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {26026#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26027#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:01:37,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {26027#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26028#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:01:37,657 INFO L290 TraceCheckUtils]: 39: Hoare triple {26028#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26029#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:01:37,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {26029#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26030#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:01:37,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {26030#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26031#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:01:37,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {26031#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26032#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:01:37,659 INFO L290 TraceCheckUtils]: 43: Hoare triple {26032#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26033#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:01:37,659 INFO L290 TraceCheckUtils]: 44: Hoare triple {26033#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26034#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:01:37,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {26034#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26035#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:01:37,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {26035#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26036#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:01:37,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {26036#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26037#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:01:37,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {26037#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26038#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:01:37,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {26038#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26039#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:01:37,662 INFO L290 TraceCheckUtils]: 50: Hoare triple {26039#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26040#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:01:37,662 INFO L290 TraceCheckUtils]: 51: Hoare triple {26040#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26041#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:01:37,663 INFO L290 TraceCheckUtils]: 52: Hoare triple {26041#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26042#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:01:37,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {26042#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26043#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 48))} is VALID [2022-04-28 03:01:37,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {26043#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 48))} assume !(~y~0 % 4294967296 < 1024); {25991#false} is VALID [2022-04-28 03:01:37,664 INFO L272 TraceCheckUtils]: 55: Hoare triple {25991#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {25991#false} is VALID [2022-04-28 03:01:37,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {25991#false} ~cond := #in~cond; {25991#false} is VALID [2022-04-28 03:01:37,664 INFO L290 TraceCheckUtils]: 57: Hoare triple {25991#false} assume 0 == ~cond; {25991#false} is VALID [2022-04-28 03:01:37,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {25991#false} assume !false; {25991#false} is VALID [2022-04-28 03:01:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:37,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:37,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46220304] [2022-04-28 03:01:37,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46220304] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:37,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670019477] [2022-04-28 03:01:37,665 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:01:37,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:37,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:37,666 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:37,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 03:01:48,200 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-28 03:01:48,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:48,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 99 conjunts are in the unsatisfiable core [2022-04-28 03:01:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:48,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:48,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {25990#true} call ULTIMATE.init(); {25990#true} is VALID [2022-04-28 03:01:48,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {25990#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(12, 2);call #Ultimate.allocInit(12, 3); {25990#true} is VALID [2022-04-28 03:01:48,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {25990#true} assume true; {25990#true} is VALID [2022-04-28 03:01:48,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25990#true} {25990#true} #34#return; {25990#true} is VALID [2022-04-28 03:01:48,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {25990#true} call #t~ret5 := main(); {25990#true} is VALID [2022-04-28 03:01:48,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {25990#true} ~x~0 := 1;~y~0 := 0; {25995#(= main_~y~0 0)} is VALID [2022-04-28 03:01:48,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {25995#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:01:48,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {25996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:01:48,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {25997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:01:48,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {25998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {25999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:01:48,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {25999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:01:48,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {26000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:01:48,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {26001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:01:48,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {26002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:01:48,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {26003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:01:48,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {26004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:01:48,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {26005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:01:48,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {26006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:01:48,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {26007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:01:48,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {26008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:01:48,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {26009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:01:48,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {26010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:01:48,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {26011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26012#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:01:48,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {26012#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26013#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:01:48,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {26013#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26014#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:01:48,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {26014#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26015#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:01:48,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {26015#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26016#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:01:48,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {26016#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26017#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:01:48,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {26017#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26018#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:01:48,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {26018#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26019#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:01:48,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {26019#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26020#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:01:48,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {26020#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26021#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:01:48,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {26021#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26022#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:01:48,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {26022#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26023#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:01:48,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {26023#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26024#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:01:48,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {26024#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26025#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:01:48,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {26025#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26026#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:01:48,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {26026#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26027#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:01:48,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {26027#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26028#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:01:48,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {26028#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26029#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:01:48,833 INFO L290 TraceCheckUtils]: 40: Hoare triple {26029#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26030#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:01:48,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {26030#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26031#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:01:48,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {26031#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26032#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:01:48,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {26032#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26033#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:01:48,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {26033#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26034#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:01:48,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {26034#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26035#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:01:48,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {26035#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26036#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:01:48,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {26036#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26037#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:01:48,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {26037#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26038#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:01:48,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {26038#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26039#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:01:48,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {26039#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26040#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:01:48,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {26040#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26041#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:01:48,838 INFO L290 TraceCheckUtils]: 52: Hoare triple {26041#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26042#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:01:48,839 INFO L290 TraceCheckUtils]: 53: Hoare triple {26042#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26207#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:01:48,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {26207#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !(~y~0 % 4294967296 < 1024); {25991#false} is VALID [2022-04-28 03:01:48,839 INFO L272 TraceCheckUtils]: 55: Hoare triple {25991#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {25991#false} is VALID [2022-04-28 03:01:48,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {25991#false} ~cond := #in~cond; {25991#false} is VALID [2022-04-28 03:01:48,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {25991#false} assume 0 == ~cond; {25991#false} is VALID [2022-04-28 03:01:48,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {25991#false} assume !false; {25991#false} is VALID [2022-04-28 03:01:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:48,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:52,552 INFO L290 TraceCheckUtils]: 58: Hoare triple {25991#false} assume !false; {25991#false} is VALID [2022-04-28 03:01:52,552 INFO L290 TraceCheckUtils]: 57: Hoare triple {25991#false} assume 0 == ~cond; {25991#false} is VALID [2022-04-28 03:01:52,552 INFO L290 TraceCheckUtils]: 56: Hoare triple {25991#false} ~cond := #in~cond; {25991#false} is VALID [2022-04-28 03:01:52,552 INFO L272 TraceCheckUtils]: 55: Hoare triple {25991#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {25991#false} is VALID [2022-04-28 03:01:52,552 INFO L290 TraceCheckUtils]: 54: Hoare triple {26235#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {25991#false} is VALID [2022-04-28 03:01:52,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {26239#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26235#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:01:52,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {26243#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26239#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,554 INFO L290 TraceCheckUtils]: 51: Hoare triple {26247#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26243#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {26251#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26247#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {26255#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26251#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,556 INFO L290 TraceCheckUtils]: 48: Hoare triple {26259#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26255#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {26263#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26259#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {26267#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26263#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {26271#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26267#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {26275#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26271#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {26279#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26275#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {26283#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26279#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {26287#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26283#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {26291#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26287#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {26295#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26291#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {26299#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26295#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {26303#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26299#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,566 INFO L290 TraceCheckUtils]: 36: Hoare triple {26307#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26303#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {26311#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26307#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {26315#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26311#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {26319#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26315#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {26323#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26319#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {26327#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26323#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {26331#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26327#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {26335#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26331#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {26339#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26335#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {26343#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26339#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {26347#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26343#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {26351#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26347#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {26355#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26351#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {26359#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26355#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {26363#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26359#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {26367#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26363#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {26371#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26367#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {26375#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26371#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {26379#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26375#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {26383#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26379#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {26387#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26383#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {26391#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26387#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {26395#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26391#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {26399#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26395#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {26403#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26399#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {26407#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26403#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {26411#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26407#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {26415#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26411#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {26419#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26415#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {26423#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26419#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {26427#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26423#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {25990#true} ~x~0 := 1;~y~0 := 0; {26427#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:01:52,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {25990#true} call #t~ret5 := main(); {25990#true} is VALID [2022-04-28 03:01:52,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25990#true} {25990#true} #34#return; {25990#true} is VALID [2022-04-28 03:01:52,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {25990#true} assume true; {25990#true} is VALID [2022-04-28 03:01:52,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {25990#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(12, 2);call #Ultimate.allocInit(12, 3); {25990#true} is VALID [2022-04-28 03:01:52,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {25990#true} call ULTIMATE.init(); {25990#true} is VALID [2022-04-28 03:01:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:52,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670019477] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:52,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:52,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 102 [2022-04-28 03:01:52,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:52,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [133611665] [2022-04-28 03:01:52,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [133611665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:52,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:52,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 03:01:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784502189] [2022-04-28 03:01:52,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:52,608 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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 59 [2022-04-28 03:01:52,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:52,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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-28 03:01:52,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:52,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 03:01:52,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:52,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 03:01:52,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2700, Invalid=7602, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 03:01:52,643 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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-28 03:01:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:57,314 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 03:01:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 03:01:57,314 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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 59 [2022-04-28 03:01:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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-28 03:01:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-28 03:01:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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-28 03:01:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-28 03:01:57,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-28 03:01:57,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:57,356 INFO L225 Difference]: With dead ends: 66 [2022-04-28 03:01:57,356 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:01:57,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5393, Invalid=17257, Unknown=0, NotChecked=0, Total=22650 [2022-04-28 03:01:57,357 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:57,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 188 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:01:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:01:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 03:01:57,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:57,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 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-28 03:01:57,432 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 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-28 03:01:57,432 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 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-28 03:01:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:57,432 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 03:01:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 03:01:57,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:57,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:57,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 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 61 states. [2022-04-28 03:01:57,433 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 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 61 states. [2022-04-28 03:01:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:57,433 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 03:01:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 03:01:57,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:57,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:57,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:57,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 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-28 03:01:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-28 03:01:57,434 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2022-04-28 03:01:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:57,434 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-28 03:01:57,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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-28 03:01:57,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-28 03:01:57,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 03:01:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 03:01:57,486 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:57,486 INFO L195 NwaCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:57,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:57,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:57,686 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:57,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:57,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2040480650, now seen corresponding path program 97 times [2022-04-28 03:01:57,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:57,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1352827747] [2022-04-28 03:01:57,958 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:01:57,959 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash 969748727, now seen corresponding path program 1 times [2022-04-28 03:01:57,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:57,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287775388] [2022-04-28 03:01:57,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:57,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:57,966 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:57,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:57,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2040480650, now seen corresponding path program 98 times [2022-04-28 03:01:57,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:57,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097996157] [2022-04-28 03:01:57,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:59,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:59,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {26977#(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(12, 2);call #Ultimate.allocInit(12, 3); {26922#true} is VALID [2022-04-28 03:01:59,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {26922#true} assume true; {26922#true} is VALID [2022-04-28 03:01:59,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26922#true} {26922#true} #34#return; {26922#true} is VALID [2022-04-28 03:01:59,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {26922#true} call ULTIMATE.init(); {26977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:59,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {26977#(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(12, 2);call #Ultimate.allocInit(12, 3); {26922#true} is VALID [2022-04-28 03:01:59,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {26922#true} assume true; {26922#true} is VALID [2022-04-28 03:01:59,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26922#true} {26922#true} #34#return; {26922#true} is VALID [2022-04-28 03:01:59,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {26922#true} call #t~ret5 := main(); {26922#true} is VALID [2022-04-28 03:01:59,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {26922#true} ~x~0 := 1;~y~0 := 0; {26927#(= main_~y~0 0)} is VALID [2022-04-28 03:01:59,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {26927#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26928#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:01:59,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {26928#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26929#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:01:59,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {26929#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:01:59,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {26930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26931#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:01:59,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {26931#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26932#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:01:59,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {26932#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26933#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:01:59,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {26933#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26934#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:01:59,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {26934#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26935#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:01:59,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {26935#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26936#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:01:59,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {26936#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26937#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:01:59,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {26937#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26938#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:01:59,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {26938#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26939#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:01:59,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {26939#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26940#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:01:59,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {26940#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26941#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:01:59,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {26941#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26942#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:01:59,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {26942#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26943#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:01:59,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {26943#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26944#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:01:59,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {26944#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26945#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:01:59,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {26945#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26946#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:01:59,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {26946#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26947#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:01:59,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {26947#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26948#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:01:59,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {26948#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26949#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:01:59,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {26949#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26950#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:01:59,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {26950#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26951#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:01:59,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {26951#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26952#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:01:59,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {26952#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26953#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:01:59,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {26953#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26954#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:01:59,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {26954#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26955#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:01:59,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {26955#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26956#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:01:59,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {26956#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26957#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:01:59,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {26957#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26958#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:01:59,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {26958#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26959#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:01:59,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {26959#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26960#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:01:59,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {26960#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26961#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:01:59,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {26961#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26962#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:01:59,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {26962#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26963#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:01:59,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {26963#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26964#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:01:59,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {26964#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26965#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:01:59,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {26965#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26966#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:01:59,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {26966#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26967#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:01:59,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {26967#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26968#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:01:59,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {26968#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26969#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:01:59,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {26969#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26970#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:01:59,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {26970#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26971#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:01:59,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {26971#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26972#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:01:59,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {26972#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26973#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:01:59,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {26973#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26974#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:01:59,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {26974#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26975#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:01:59,217 INFO L290 TraceCheckUtils]: 54: Hoare triple {26975#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26976#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 49))} is VALID [2022-04-28 03:01:59,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {26976#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 49))} assume !(~y~0 % 4294967296 < 1024); {26923#false} is VALID [2022-04-28 03:01:59,217 INFO L272 TraceCheckUtils]: 56: Hoare triple {26923#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {26923#false} is VALID [2022-04-28 03:01:59,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {26923#false} ~cond := #in~cond; {26923#false} is VALID [2022-04-28 03:01:59,217 INFO L290 TraceCheckUtils]: 58: Hoare triple {26923#false} assume 0 == ~cond; {26923#false} is VALID [2022-04-28 03:01:59,218 INFO L290 TraceCheckUtils]: 59: Hoare triple {26923#false} assume !false; {26923#false} is VALID [2022-04-28 03:01:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:59,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:59,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097996157] [2022-04-28 03:01:59,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097996157] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:59,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843209251] [2022-04-28 03:01:59,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:01:59,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:59,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:59,219 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:59,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 03:01:59,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:01:59,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:59,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 101 conjunts are in the unsatisfiable core [2022-04-28 03:01:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:59,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:59,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {26922#true} call ULTIMATE.init(); {26922#true} is VALID [2022-04-28 03:01:59,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {26922#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(12, 2);call #Ultimate.allocInit(12, 3); {26922#true} is VALID [2022-04-28 03:01:59,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {26922#true} assume true; {26922#true} is VALID [2022-04-28 03:01:59,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26922#true} {26922#true} #34#return; {26922#true} is VALID [2022-04-28 03:01:59,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {26922#true} call #t~ret5 := main(); {26922#true} is VALID [2022-04-28 03:01:59,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {26922#true} ~x~0 := 1;~y~0 := 0; {26927#(= main_~y~0 0)} is VALID [2022-04-28 03:01:59,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {26927#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26928#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:01:59,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {26928#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26929#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:01:59,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {26929#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:01:59,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {26930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26931#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:01:59,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {26931#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26932#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:01:59,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {26932#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26933#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:01:59,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {26933#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26934#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:01:59,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {26934#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26935#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:01:59,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {26935#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26936#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:01:59,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {26936#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26937#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:01:59,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {26937#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26938#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:01:59,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {26938#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26939#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:01:59,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {26939#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26940#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:01:59,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {26940#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26941#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:01:59,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {26941#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26942#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:01:59,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {26942#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26943#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:01:59,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {26943#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26944#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:01:59,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {26944#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26945#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:01:59,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {26945#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26946#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:01:59,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {26946#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26947#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:01:59,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {26947#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26948#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:01:59,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {26948#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26949#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:01:59,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {26949#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26950#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:01:59,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {26950#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26951#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:01:59,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {26951#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26952#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:01:59,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {26952#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26953#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:01:59,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {26953#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26954#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:01:59,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {26954#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26955#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:01:59,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {26955#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26956#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:01:59,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {26956#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26957#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:01:59,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {26957#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26958#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:01:59,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {26958#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26959#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:01:59,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {26959#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26960#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:01:59,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {26960#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26961#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:01:59,880 INFO L290 TraceCheckUtils]: 40: Hoare triple {26961#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26962#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:01:59,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {26962#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26963#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:01:59,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {26963#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26964#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:01:59,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {26964#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26965#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:01:59,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {26965#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26966#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:01:59,883 INFO L290 TraceCheckUtils]: 45: Hoare triple {26966#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26967#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:01:59,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {26967#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26968#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:01:59,884 INFO L290 TraceCheckUtils]: 47: Hoare triple {26968#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26969#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:01:59,884 INFO L290 TraceCheckUtils]: 48: Hoare triple {26969#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26970#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:01:59,885 INFO L290 TraceCheckUtils]: 49: Hoare triple {26970#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26971#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:01:59,885 INFO L290 TraceCheckUtils]: 50: Hoare triple {26971#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26972#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:01:59,886 INFO L290 TraceCheckUtils]: 51: Hoare triple {26972#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26973#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:01:59,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {26973#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26974#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:01:59,887 INFO L290 TraceCheckUtils]: 53: Hoare triple {26974#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {26975#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:01:59,887 INFO L290 TraceCheckUtils]: 54: Hoare triple {26975#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27143#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:01:59,888 INFO L290 TraceCheckUtils]: 55: Hoare triple {27143#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !(~y~0 % 4294967296 < 1024); {26923#false} is VALID [2022-04-28 03:01:59,888 INFO L272 TraceCheckUtils]: 56: Hoare triple {26923#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {26923#false} is VALID [2022-04-28 03:01:59,888 INFO L290 TraceCheckUtils]: 57: Hoare triple {26923#false} ~cond := #in~cond; {26923#false} is VALID [2022-04-28 03:01:59,888 INFO L290 TraceCheckUtils]: 58: Hoare triple {26923#false} assume 0 == ~cond; {26923#false} is VALID [2022-04-28 03:01:59,888 INFO L290 TraceCheckUtils]: 59: Hoare triple {26923#false} assume !false; {26923#false} is VALID [2022-04-28 03:01:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:59,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:03,534 INFO L290 TraceCheckUtils]: 59: Hoare triple {26923#false} assume !false; {26923#false} is VALID [2022-04-28 03:02:03,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {26923#false} assume 0 == ~cond; {26923#false} is VALID [2022-04-28 03:02:03,535 INFO L290 TraceCheckUtils]: 57: Hoare triple {26923#false} ~cond := #in~cond; {26923#false} is VALID [2022-04-28 03:02:03,535 INFO L272 TraceCheckUtils]: 56: Hoare triple {26923#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {26923#false} is VALID [2022-04-28 03:02:03,535 INFO L290 TraceCheckUtils]: 55: Hoare triple {27171#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {26923#false} is VALID [2022-04-28 03:02:03,536 INFO L290 TraceCheckUtils]: 54: Hoare triple {27175#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27171#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:02:03,536 INFO L290 TraceCheckUtils]: 53: Hoare triple {27179#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27175#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {27183#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27179#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,538 INFO L290 TraceCheckUtils]: 51: Hoare triple {27187#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27183#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,538 INFO L290 TraceCheckUtils]: 50: Hoare triple {27191#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27187#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {27195#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27191#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {27199#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27195#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,541 INFO L290 TraceCheckUtils]: 47: Hoare triple {27203#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27199#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {27207#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27203#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,542 INFO L290 TraceCheckUtils]: 45: Hoare triple {27211#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27207#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {27215#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27211#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,543 INFO L290 TraceCheckUtils]: 43: Hoare triple {27219#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27215#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {27223#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27219#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {27227#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27223#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,545 INFO L290 TraceCheckUtils]: 40: Hoare triple {27231#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27227#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {27235#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27231#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {27239#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27235#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {27243#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27239#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {27247#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27243#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {27251#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27247#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {27255#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27251#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {27259#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27255#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {27263#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27259#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {27267#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27263#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {27271#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27267#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {27275#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27271#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {27279#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27275#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {27283#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27279#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {27287#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27283#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {27291#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27287#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {27295#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27291#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {27299#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27295#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {27303#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27299#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {27307#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27303#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {27311#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27307#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {27315#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27311#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {27319#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27315#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {27323#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27319#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {27327#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27323#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {27331#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27327#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {27335#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27331#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {27339#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27335#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {27343#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27339#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {27347#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27343#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {27351#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27347#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {27355#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27351#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {27359#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27355#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {27363#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27359#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {27367#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27363#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {26922#true} ~x~0 := 1;~y~0 := 0; {27367#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:03,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {26922#true} call #t~ret5 := main(); {26922#true} is VALID [2022-04-28 03:02:03,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26922#true} {26922#true} #34#return; {26922#true} is VALID [2022-04-28 03:02:03,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {26922#true} assume true; {26922#true} is VALID [2022-04-28 03:02:03,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {26922#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(12, 2);call #Ultimate.allocInit(12, 3); {26922#true} is VALID [2022-04-28 03:02:03,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {26922#true} call ULTIMATE.init(); {26922#true} is VALID [2022-04-28 03:02:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:03,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843209251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:03,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:03,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-28 03:02:03,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:03,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1352827747] [2022-04-28 03:02:03,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1352827747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:03,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:03,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 03:02:03,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564849879] [2022-04-28 03:02:03,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:03,571 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 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 60 [2022-04-28 03:02:03,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:03,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 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-28 03:02:03,604 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-28 03:02:03,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 03:02:03,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:03,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 03:02:03,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2805, Invalid=7907, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 03:02:03,606 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 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-28 03:02:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:08,356 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 03:02:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 03:02:08,356 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 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 60 [2022-04-28 03:02:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 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-28 03:02:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-28 03:02:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 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-28 03:02:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-28 03:02:08,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions. [2022-04-28 03:02:08,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:08,397 INFO L225 Difference]: With dead ends: 67 [2022-04-28 03:02:08,397 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 03:02:08,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5603, Invalid=17959, Unknown=0, NotChecked=0, Total=23562 [2022-04-28 03:02:08,398 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:08,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 173 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:02:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 03:02:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 03:02:08,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:08,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 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-28 03:02:08,457 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 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-28 03:02:08,457 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 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-28 03:02:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:08,458 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 03:02:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 03:02:08,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:08,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:08,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 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 62 states. [2022-04-28 03:02:08,458 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 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 62 states. [2022-04-28 03:02:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:08,459 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 03:02:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 03:02:08,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:08,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:08,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:08,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 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-28 03:02:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2022-04-28 03:02:08,460 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2022-04-28 03:02:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:08,460 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2022-04-28 03:02:08,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 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-28 03:02:08,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 62 transitions. [2022-04-28 03:02:08,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 03:02:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 03:02:08,521 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:08,521 INFO L195 NwaCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:08,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:08,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98,SelfDestructingSolverStorable99 [2022-04-28 03:02:08,735 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:08,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1206070556, now seen corresponding path program 99 times [2022-04-28 03:02:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:08,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [337162639] [2022-04-28 03:02:09,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:02:09,546 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:09,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1028854071, now seen corresponding path program 1 times [2022-04-28 03:02:09,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:09,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628660388] [2022-04-28 03:02:09,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:09,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:09,552 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:09,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1206070556, now seen corresponding path program 100 times [2022-04-28 03:02:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:09,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073629166] [2022-04-28 03:02:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:09,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:10,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:10,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {27926#(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(12, 2);call #Ultimate.allocInit(12, 3); {27870#true} is VALID [2022-04-28 03:02:10,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {27870#true} assume true; {27870#true} is VALID [2022-04-28 03:02:10,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27870#true} {27870#true} #34#return; {27870#true} is VALID [2022-04-28 03:02:10,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {27870#true} call ULTIMATE.init(); {27926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:10,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {27926#(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(12, 2);call #Ultimate.allocInit(12, 3); {27870#true} is VALID [2022-04-28 03:02:10,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {27870#true} assume true; {27870#true} is VALID [2022-04-28 03:02:10,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27870#true} {27870#true} #34#return; {27870#true} is VALID [2022-04-28 03:02:10,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {27870#true} call #t~ret5 := main(); {27870#true} is VALID [2022-04-28 03:02:10,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {27870#true} ~x~0 := 1;~y~0 := 0; {27875#(= main_~y~0 0)} is VALID [2022-04-28 03:02:10,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {27875#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:02:10,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {27876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:02:10,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {27877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:02:10,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {27878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:02:10,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {27879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:02:10,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {27880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:02:10,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {27881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:02:10,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {27882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27883#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:02:10,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {27883#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27884#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:02:10,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {27884#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27885#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:02:10,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {27885#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27886#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:02:10,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {27886#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:02:10,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {27887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27888#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:02:10,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {27888#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27889#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:02:10,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {27889#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27890#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:02:10,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {27890#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27891#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:02:10,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {27891#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27892#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:02:10,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {27892#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27893#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:02:10,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {27893#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27894#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:02:10,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {27894#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27895#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:02:10,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {27895#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27896#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:02:10,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {27896#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27897#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:02:10,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {27897#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27898#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:02:10,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {27898#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27899#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:02:10,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {27899#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27900#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:02:10,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {27900#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27901#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:02:10,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {27901#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27902#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:02:10,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {27902#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27903#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:02:10,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {27903#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27904#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:02:10,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {27904#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27905#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:02:10,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {27905#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27906#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:02:10,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {27906#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27907#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:02:10,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {27907#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27908#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:02:10,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {27908#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27909#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:02:10,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {27909#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27910#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:02:10,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {27910#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27911#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:02:10,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {27911#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27912#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:02:10,826 INFO L290 TraceCheckUtils]: 43: Hoare triple {27912#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27913#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:02:10,826 INFO L290 TraceCheckUtils]: 44: Hoare triple {27913#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27914#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:02:10,827 INFO L290 TraceCheckUtils]: 45: Hoare triple {27914#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27915#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:02:10,827 INFO L290 TraceCheckUtils]: 46: Hoare triple {27915#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27916#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:02:10,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {27916#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27917#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:02:10,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {27917#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27918#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:02:10,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {27918#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27919#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:02:10,829 INFO L290 TraceCheckUtils]: 50: Hoare triple {27919#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27920#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:02:10,829 INFO L290 TraceCheckUtils]: 51: Hoare triple {27920#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27921#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:02:10,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {27921#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27922#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:02:10,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {27922#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27923#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:02:10,831 INFO L290 TraceCheckUtils]: 54: Hoare triple {27923#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27924#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:02:10,831 INFO L290 TraceCheckUtils]: 55: Hoare triple {27924#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27925#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 50))} is VALID [2022-04-28 03:02:10,832 INFO L290 TraceCheckUtils]: 56: Hoare triple {27925#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 50))} assume !(~y~0 % 4294967296 < 1024); {27871#false} is VALID [2022-04-28 03:02:10,832 INFO L272 TraceCheckUtils]: 57: Hoare triple {27871#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {27871#false} is VALID [2022-04-28 03:02:10,832 INFO L290 TraceCheckUtils]: 58: Hoare triple {27871#false} ~cond := #in~cond; {27871#false} is VALID [2022-04-28 03:02:10,832 INFO L290 TraceCheckUtils]: 59: Hoare triple {27871#false} assume 0 == ~cond; {27871#false} is VALID [2022-04-28 03:02:10,832 INFO L290 TraceCheckUtils]: 60: Hoare triple {27871#false} assume !false; {27871#false} is VALID [2022-04-28 03:02:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:10,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:10,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073629166] [2022-04-28 03:02:10,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073629166] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:10,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767383476] [2022-04-28 03:02:10,833 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:02:10,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:10,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:10,834 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:10,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 03:02:10,947 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:02:10,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:10,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 103 conjunts are in the unsatisfiable core [2022-04-28 03:02:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:10,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:11,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {27870#true} call ULTIMATE.init(); {27870#true} is VALID [2022-04-28 03:02:11,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {27870#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(12, 2);call #Ultimate.allocInit(12, 3); {27870#true} is VALID [2022-04-28 03:02:11,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {27870#true} assume true; {27870#true} is VALID [2022-04-28 03:02:11,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27870#true} {27870#true} #34#return; {27870#true} is VALID [2022-04-28 03:02:11,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {27870#true} call #t~ret5 := main(); {27870#true} is VALID [2022-04-28 03:02:11,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {27870#true} ~x~0 := 1;~y~0 := 0; {27875#(= main_~y~0 0)} is VALID [2022-04-28 03:02:11,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {27875#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:02:11,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {27876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:02:11,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {27877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:02:11,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {27878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:02:11,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {27879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:02:11,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {27880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:02:11,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {27881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:02:11,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {27882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27883#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:02:11,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {27883#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27884#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:02:11,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {27884#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27885#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:02:11,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {27885#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27886#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:02:11,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {27886#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:02:11,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {27887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27888#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:02:11,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {27888#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27889#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:02:11,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {27889#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27890#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:02:11,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {27890#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27891#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:02:11,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {27891#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27892#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:02:11,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {27892#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27893#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:02:11,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {27893#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27894#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:02:11,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {27894#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27895#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:02:11,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {27895#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27896#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:02:11,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {27896#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27897#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:02:11,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {27897#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27898#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:02:11,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {27898#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27899#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:02:11,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {27899#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27900#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:02:11,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {27900#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27901#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:02:11,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {27901#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27902#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:02:11,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {27902#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27903#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:02:11,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {27903#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27904#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:02:11,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {27904#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27905#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:02:11,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {27905#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27906#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:02:11,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {27906#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27907#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:02:11,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {27907#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27908#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:02:11,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {27908#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27909#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:02:11,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {27909#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27910#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:02:11,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {27910#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27911#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:02:11,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {27911#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27912#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:02:11,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {27912#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27913#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:02:11,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {27913#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27914#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:02:11,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {27914#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27915#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:02:11,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {27915#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27916#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:02:11,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {27916#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27917#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:02:11,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {27917#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27918#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:02:11,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {27918#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27919#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:02:11,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {27919#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27920#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:02:11,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {27920#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27921#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:02:11,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {27921#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27922#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:02:11,507 INFO L290 TraceCheckUtils]: 53: Hoare triple {27922#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27923#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:02:11,507 INFO L290 TraceCheckUtils]: 54: Hoare triple {27923#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {27924#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:02:11,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {27924#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28095#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:02:11,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {28095#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !(~y~0 % 4294967296 < 1024); {27871#false} is VALID [2022-04-28 03:02:11,508 INFO L272 TraceCheckUtils]: 57: Hoare triple {27871#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {27871#false} is VALID [2022-04-28 03:02:11,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {27871#false} ~cond := #in~cond; {27871#false} is VALID [2022-04-28 03:02:11,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {27871#false} assume 0 == ~cond; {27871#false} is VALID [2022-04-28 03:02:11,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {27871#false} assume !false; {27871#false} is VALID [2022-04-28 03:02:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:11,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:15,295 INFO L290 TraceCheckUtils]: 60: Hoare triple {27871#false} assume !false; {27871#false} is VALID [2022-04-28 03:02:15,295 INFO L290 TraceCheckUtils]: 59: Hoare triple {27871#false} assume 0 == ~cond; {27871#false} is VALID [2022-04-28 03:02:15,295 INFO L290 TraceCheckUtils]: 58: Hoare triple {27871#false} ~cond := #in~cond; {27871#false} is VALID [2022-04-28 03:02:15,295 INFO L272 TraceCheckUtils]: 57: Hoare triple {27871#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {27871#false} is VALID [2022-04-28 03:02:15,296 INFO L290 TraceCheckUtils]: 56: Hoare triple {28123#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {27871#false} is VALID [2022-04-28 03:02:15,296 INFO L290 TraceCheckUtils]: 55: Hoare triple {28127#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28123#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:02:15,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {28131#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28127#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {28135#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28131#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,306 INFO L290 TraceCheckUtils]: 52: Hoare triple {28139#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28135#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,307 INFO L290 TraceCheckUtils]: 51: Hoare triple {28143#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28139#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {28147#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28143#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,308 INFO L290 TraceCheckUtils]: 49: Hoare triple {28151#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28147#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {28155#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28151#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {28159#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28155#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {28163#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28159#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {28167#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28163#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {28171#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28167#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,312 INFO L290 TraceCheckUtils]: 43: Hoare triple {28175#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28171#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {28179#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28175#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {28183#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28179#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {28187#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28183#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,314 INFO L290 TraceCheckUtils]: 39: Hoare triple {28191#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28187#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {28195#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28191#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {28199#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28195#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {28203#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28199#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {28207#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28203#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {28211#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28207#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {28215#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28211#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {28219#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28215#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {28223#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28219#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {28227#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28223#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {28231#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28227#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {28235#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28231#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {28239#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28235#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {28243#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28239#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {28247#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28243#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {28251#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28247#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {28255#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28251#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {28259#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28255#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {28263#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28259#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {28267#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28263#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {28271#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28267#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {28275#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28271#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {28279#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28275#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {28283#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28279#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {28287#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28283#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {28291#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28287#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {28295#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28291#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {28299#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28295#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {28303#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28299#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {28307#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28303#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {28311#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28307#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {28315#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28311#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {28319#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28315#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {28323#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28319#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {27870#true} ~x~0 := 1;~y~0 := 0; {28323#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:02:15,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {27870#true} call #t~ret5 := main(); {27870#true} is VALID [2022-04-28 03:02:15,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27870#true} {27870#true} #34#return; {27870#true} is VALID [2022-04-28 03:02:15,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {27870#true} assume true; {27870#true} is VALID [2022-04-28 03:02:15,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {27870#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(12, 2);call #Ultimate.allocInit(12, 3); {27870#true} is VALID [2022-04-28 03:02:15,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {27870#true} call ULTIMATE.init(); {27870#true} is VALID [2022-04-28 03:02:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:15,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767383476] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:15,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:15,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 106 [2022-04-28 03:02:15,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:15,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [337162639] [2022-04-28 03:02:15,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [337162639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:15,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:15,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 03:02:15,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643096363] [2022-04-28 03:02:15,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:15,337 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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 61 [2022-04-28 03:02:15,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:15,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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-28 03:02:15,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:15,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 03:02:15,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:15,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 03:02:15,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2912, Invalid=8218, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 03:02:15,386 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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-28 03:02:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:20,200 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 03:02:20,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 03:02:20,200 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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 61 [2022-04-28 03:02:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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-28 03:02:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-28 03:02:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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-28 03:02:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-28 03:02:20,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 68 transitions. [2022-04-28 03:02:20,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:20,242 INFO L225 Difference]: With dead ends: 68 [2022-04-28 03:02:20,242 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 03:02:20,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1381 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5817, Invalid=18675, Unknown=0, NotChecked=0, Total=24492 [2022-04-28 03:02:20,243 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2572 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:20,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 2675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2572 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:02:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 03:02:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-28 03:02:20,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:20,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 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-28 03:02:20,318 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 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-28 03:02:20,318 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 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-28 03:02:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:20,318 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 03:02:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 03:02:20,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:20,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:20,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 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 63 states. [2022-04-28 03:02:20,319 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 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 63 states. [2022-04-28 03:02:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:20,319 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 03:02:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 03:02:20,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:20,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:20,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:20,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 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-28 03:02:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-28 03:02:20,320 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2022-04-28 03:02:20,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:20,320 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-28 03:02:20,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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-28 03:02:20,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-28 03:02:20,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 03:02:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 03:02:20,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:20,366 INFO L195 NwaCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:20,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:20,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101 [2022-04-28 03:02:20,566 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:20,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1230057162, now seen corresponding path program 101 times [2022-04-28 03:02:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:20,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2097610370] [2022-04-28 03:02:21,211 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:02:21,445 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:02:21,446 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1087959415, now seen corresponding path program 1 times [2022-04-28 03:02:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:21,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388332012] [2022-04-28 03:02:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:21,453 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:21,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:21,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1230057162, now seen corresponding path program 102 times [2022-04-28 03:02:21,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:21,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526734926] [2022-04-28 03:02:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:22,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {28891#(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(12, 2);call #Ultimate.allocInit(12, 3); {28834#true} is VALID [2022-04-28 03:02:22,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {28834#true} assume true; {28834#true} is VALID [2022-04-28 03:02:22,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28834#true} {28834#true} #34#return; {28834#true} is VALID [2022-04-28 03:02:22,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {28834#true} call ULTIMATE.init(); {28891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:22,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {28891#(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(12, 2);call #Ultimate.allocInit(12, 3); {28834#true} is VALID [2022-04-28 03:02:22,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {28834#true} assume true; {28834#true} is VALID [2022-04-28 03:02:22,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28834#true} {28834#true} #34#return; {28834#true} is VALID [2022-04-28 03:02:22,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {28834#true} call #t~ret5 := main(); {28834#true} is VALID [2022-04-28 03:02:22,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {28834#true} ~x~0 := 1;~y~0 := 0; {28839#(= main_~y~0 0)} is VALID [2022-04-28 03:02:22,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {28839#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28840#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:02:22,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {28840#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28841#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:02:22,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {28841#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28842#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:02:22,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {28842#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28843#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:02:22,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {28843#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28844#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:02:22,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {28844#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28845#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:02:22,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {28845#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28846#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:02:22,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {28846#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28847#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:02:22,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {28847#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28848#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:02:22,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {28848#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28849#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:02:22,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {28849#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28850#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:02:22,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {28850#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28851#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:02:22,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {28851#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28852#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:02:22,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {28852#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28853#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:02:22,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {28853#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28854#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:02:22,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {28854#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28855#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:02:22,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {28855#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28856#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:02:22,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {28856#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28857#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:02:22,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {28857#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28858#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:02:22,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {28858#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28859#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:02:22,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {28859#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28860#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:02:22,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {28860#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28861#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:02:22,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {28861#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28862#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:02:22,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {28862#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28863#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:02:22,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {28863#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28864#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:02:22,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {28864#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28865#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:02:22,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {28865#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28866#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:02:22,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {28866#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28867#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:02:22,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {28867#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28868#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:02:22,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {28868#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28869#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:02:22,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {28869#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28870#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:02:22,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {28870#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28871#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:02:22,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {28871#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28872#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:02:22,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {28872#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28873#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:02:22,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {28873#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28874#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:02:22,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {28874#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28875#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:02:22,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {28875#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28876#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:02:22,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {28876#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28877#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:02:22,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {28877#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28878#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:02:22,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {28878#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28879#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:02:22,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {28879#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28880#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:02:22,794 INFO L290 TraceCheckUtils]: 47: Hoare triple {28880#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28881#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:02:22,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {28881#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28882#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:02:22,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {28882#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28883#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:02:22,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {28883#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28884#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:02:22,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {28884#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28885#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:02:22,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {28885#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28886#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:02:22,796 INFO L290 TraceCheckUtils]: 53: Hoare triple {28886#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28887#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:02:22,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {28887#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28888#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:02:22,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {28888#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28889#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:02:22,798 INFO L290 TraceCheckUtils]: 56: Hoare triple {28889#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28890#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 51))} is VALID [2022-04-28 03:02:22,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {28890#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 51))} assume !(~y~0 % 4294967296 < 1024); {28835#false} is VALID [2022-04-28 03:02:22,798 INFO L272 TraceCheckUtils]: 58: Hoare triple {28835#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {28835#false} is VALID [2022-04-28 03:02:22,799 INFO L290 TraceCheckUtils]: 59: Hoare triple {28835#false} ~cond := #in~cond; {28835#false} is VALID [2022-04-28 03:02:22,799 INFO L290 TraceCheckUtils]: 60: Hoare triple {28835#false} assume 0 == ~cond; {28835#false} is VALID [2022-04-28 03:02:22,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {28835#false} assume !false; {28835#false} is VALID [2022-04-28 03:02:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:22,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:22,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526734926] [2022-04-28 03:02:22,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526734926] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:22,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526605376] [2022-04-28 03:02:22,799 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:02:22,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:22,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:22,800 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:22,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-28 03:02:34,885 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2022-04-28 03:02:34,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:34,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 105 conjunts are in the unsatisfiable core [2022-04-28 03:02:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:34,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:35,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {28834#true} call ULTIMATE.init(); {28834#true} is VALID [2022-04-28 03:02:35,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {28834#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(12, 2);call #Ultimate.allocInit(12, 3); {28834#true} is VALID [2022-04-28 03:02:35,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {28834#true} assume true; {28834#true} is VALID [2022-04-28 03:02:35,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28834#true} {28834#true} #34#return; {28834#true} is VALID [2022-04-28 03:02:35,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {28834#true} call #t~ret5 := main(); {28834#true} is VALID [2022-04-28 03:02:35,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {28834#true} ~x~0 := 1;~y~0 := 0; {28839#(= main_~y~0 0)} is VALID [2022-04-28 03:02:35,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {28839#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28840#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:02:35,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {28840#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28841#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:02:35,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {28841#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28842#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:02:35,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {28842#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28843#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:02:35,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {28843#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28844#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:02:35,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {28844#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28845#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:02:35,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {28845#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28846#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:02:35,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {28846#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28847#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:02:35,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {28847#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28848#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:02:35,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {28848#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28849#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:02:35,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {28849#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28850#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:02:35,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {28850#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28851#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:02:35,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {28851#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28852#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:02:35,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {28852#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28853#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:02:35,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {28853#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28854#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:02:35,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {28854#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28855#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:02:35,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {28855#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28856#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:02:35,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {28856#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28857#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:02:35,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {28857#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28858#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:02:35,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {28858#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28859#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:02:35,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {28859#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28860#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:02:35,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {28860#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28861#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:02:35,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {28861#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28862#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:02:35,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {28862#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28863#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:02:35,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {28863#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28864#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:02:35,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {28864#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28865#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:02:35,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {28865#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28866#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:02:35,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {28866#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28867#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:02:35,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {28867#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28868#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:02:35,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {28868#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28869#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:02:35,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {28869#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28870#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:02:35,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {28870#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28871#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:02:35,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {28871#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28872#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:02:35,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {28872#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28873#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:02:35,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {28873#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28874#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:02:35,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {28874#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28875#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:02:35,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {28875#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28876#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:02:35,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {28876#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28877#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:02:35,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {28877#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28878#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:02:35,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {28878#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28879#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:02:35,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {28879#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28880#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:02:35,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {28880#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28881#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:02:35,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {28881#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28882#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:02:35,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {28882#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28883#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:02:35,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {28883#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28884#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:02:35,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {28884#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28885#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:02:35,470 INFO L290 TraceCheckUtils]: 52: Hoare triple {28885#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28886#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:02:35,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {28886#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28887#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:02:35,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {28887#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28888#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:02:35,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {28888#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {28889#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:02:35,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {28889#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29063#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:02:35,472 INFO L290 TraceCheckUtils]: 57: Hoare triple {29063#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !(~y~0 % 4294967296 < 1024); {28835#false} is VALID [2022-04-28 03:02:35,472 INFO L272 TraceCheckUtils]: 58: Hoare triple {28835#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {28835#false} is VALID [2022-04-28 03:02:35,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {28835#false} ~cond := #in~cond; {28835#false} is VALID [2022-04-28 03:02:35,472 INFO L290 TraceCheckUtils]: 60: Hoare triple {28835#false} assume 0 == ~cond; {28835#false} is VALID [2022-04-28 03:02:35,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {28835#false} assume !false; {28835#false} is VALID [2022-04-28 03:02:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:35,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:39,434 INFO L290 TraceCheckUtils]: 61: Hoare triple {28835#false} assume !false; {28835#false} is VALID [2022-04-28 03:02:39,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {28835#false} assume 0 == ~cond; {28835#false} is VALID [2022-04-28 03:02:39,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {28835#false} ~cond := #in~cond; {28835#false} is VALID [2022-04-28 03:02:39,435 INFO L272 TraceCheckUtils]: 58: Hoare triple {28835#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {28835#false} is VALID [2022-04-28 03:02:39,435 INFO L290 TraceCheckUtils]: 57: Hoare triple {29091#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {28835#false} is VALID [2022-04-28 03:02:39,436 INFO L290 TraceCheckUtils]: 56: Hoare triple {29095#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29091#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:02:39,436 INFO L290 TraceCheckUtils]: 55: Hoare triple {29099#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29095#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {29103#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29099#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {29107#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29103#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {29111#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29107#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,439 INFO L290 TraceCheckUtils]: 51: Hoare triple {29115#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29111#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,439 INFO L290 TraceCheckUtils]: 50: Hoare triple {29119#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29115#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {29123#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29119#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {29127#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29123#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,441 INFO L290 TraceCheckUtils]: 47: Hoare triple {29131#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29127#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {29135#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29131#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {29139#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29135#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {29143#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29139#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {29147#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29143#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {29151#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29147#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,445 INFO L290 TraceCheckUtils]: 41: Hoare triple {29155#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29151#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {29159#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29155#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {29163#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29159#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {29167#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29163#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {29171#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29167#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {29175#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29171#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {29179#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29175#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {29183#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29179#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {29187#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29183#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {29191#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29187#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {29195#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29191#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {29199#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29195#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {29203#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29199#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {29207#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29203#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {29211#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29207#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {29215#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29211#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {29219#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29215#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {29223#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29219#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {29227#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29223#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {29231#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29227#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {29235#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29231#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {29239#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29235#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {29243#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29239#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {29247#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29243#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {29251#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29247#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {29255#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29251#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {29259#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29255#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {29263#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29259#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {29267#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29263#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {29271#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29267#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {29275#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29271#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {29279#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29275#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {29283#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29279#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {29287#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29283#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {29291#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29287#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {29295#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29291#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {28834#true} ~x~0 := 1;~y~0 := 0; {29295#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:39,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {28834#true} call #t~ret5 := main(); {28834#true} is VALID [2022-04-28 03:02:39,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28834#true} {28834#true} #34#return; {28834#true} is VALID [2022-04-28 03:02:39,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {28834#true} assume true; {28834#true} is VALID [2022-04-28 03:02:39,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {28834#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(12, 2);call #Ultimate.allocInit(12, 3); {28834#true} is VALID [2022-04-28 03:02:39,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {28834#true} call ULTIMATE.init(); {28834#true} is VALID [2022-04-28 03:02:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:39,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526605376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:39,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:39,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 108 [2022-04-28 03:02:39,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:39,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2097610370] [2022-04-28 03:02:39,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2097610370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:39,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:39,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 03:02:39,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705007487] [2022-04-28 03:02:39,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:39,469 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 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 62 [2022-04-28 03:02:39,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:39,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 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-28 03:02:39,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:39,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 03:02:39,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 03:02:39,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3021, Invalid=8535, Unknown=0, NotChecked=0, Total=11556 [2022-04-28 03:02:39,507 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 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-28 03:02:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:44,568 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 03:02:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 03:02:44,569 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 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 62 [2022-04-28 03:02:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 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-28 03:02:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-28 03:02:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 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-28 03:02:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-28 03:02:44,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-28 03:02:44,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:44,612 INFO L225 Difference]: With dead ends: 69 [2022-04-28 03:02:44,612 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 03:02:44,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=6035, Invalid=19405, Unknown=0, NotChecked=0, Total=25440 [2022-04-28 03:02:44,614 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2724 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:44,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2724 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:02:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 03:02:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-28 03:02:44,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:44,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 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-28 03:02:44,680 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 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-28 03:02:44,680 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 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-28 03:02:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:44,681 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 03:02:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 03:02:44,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:44,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:44,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 03:02:44,708 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 03:02:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:44,709 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 03:02:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 03:02:44,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:44,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:44,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:44,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 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-28 03:02:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2022-04-28 03:02:44,710 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2022-04-28 03:02:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:44,710 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2022-04-28 03:02:44,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 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-28 03:02:44,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 64 transitions. [2022-04-28 03:02:44,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 03:02:44,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 03:02:44,766 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:44,766 INFO L195 NwaCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:44,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:44,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103 [2022-04-28 03:02:44,971 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:44,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:44,972 INFO L85 PathProgramCache]: Analyzing trace with hash 559394908, now seen corresponding path program 103 times [2022-04-28 03:02:44,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:44,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1857204992] [2022-04-28 03:02:45,316 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:02:45,317 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:45,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1147064759, now seen corresponding path program 1 times [2022-04-28 03:02:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:45,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786327566] [2022-04-28 03:02:45,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:45,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:45,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:45,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash 559394908, now seen corresponding path program 104 times [2022-04-28 03:02:45,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:45,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877096157] [2022-04-28 03:02:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:45,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:46,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:46,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {29872#(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(12, 2);call #Ultimate.allocInit(12, 3); {29814#true} is VALID [2022-04-28 03:02:46,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {29814#true} assume true; {29814#true} is VALID [2022-04-28 03:02:46,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29814#true} {29814#true} #34#return; {29814#true} is VALID [2022-04-28 03:02:46,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {29814#true} call ULTIMATE.init(); {29872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:46,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {29872#(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(12, 2);call #Ultimate.allocInit(12, 3); {29814#true} is VALID [2022-04-28 03:02:46,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {29814#true} assume true; {29814#true} is VALID [2022-04-28 03:02:46,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29814#true} {29814#true} #34#return; {29814#true} is VALID [2022-04-28 03:02:46,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {29814#true} call #t~ret5 := main(); {29814#true} is VALID [2022-04-28 03:02:46,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {29814#true} ~x~0 := 1;~y~0 := 0; {29819#(= main_~y~0 0)} is VALID [2022-04-28 03:02:46,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {29819#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29820#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:02:46,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {29820#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29821#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:02:46,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {29821#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29822#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:02:46,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {29822#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29823#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:02:46,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {29823#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29824#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:02:46,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {29824#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29825#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:02:46,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {29825#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29826#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:02:46,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {29826#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29827#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:02:46,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {29827#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29828#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:02:46,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {29828#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29829#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:02:46,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {29829#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29830#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:02:46,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {29830#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29831#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:02:46,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {29831#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29832#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:02:46,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {29832#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29833#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:02:46,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {29833#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29834#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:02:46,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {29834#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29835#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:02:46,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {29835#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29836#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:02:46,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {29836#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29837#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:02:46,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {29837#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29838#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:02:46,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {29838#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29839#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:02:46,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {29839#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29840#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:02:46,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {29840#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29841#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:02:46,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {29841#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29842#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:02:46,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {29842#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29843#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:02:46,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {29843#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29844#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:02:46,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {29844#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29845#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:02:46,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {29845#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29846#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:02:46,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {29846#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29847#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:02:46,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {29847#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29848#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:02:46,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {29848#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29849#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:02:46,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {29849#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29850#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:02:46,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {29850#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29851#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:02:46,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {29851#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29852#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:02:46,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {29852#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29853#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:02:46,695 INFO L290 TraceCheckUtils]: 40: Hoare triple {29853#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29854#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:02:46,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {29854#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29855#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:02:46,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {29855#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29856#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:02:46,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {29856#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29857#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:02:46,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {29857#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29858#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:02:46,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {29858#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29859#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:02:46,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {29859#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29860#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:02:46,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {29860#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29861#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:02:46,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {29861#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29862#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:02:46,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {29862#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29863#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:02:46,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {29863#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29864#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:02:46,705 INFO L290 TraceCheckUtils]: 51: Hoare triple {29864#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29865#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:02:46,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {29865#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29866#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:02:46,706 INFO L290 TraceCheckUtils]: 53: Hoare triple {29866#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29867#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:02:46,706 INFO L290 TraceCheckUtils]: 54: Hoare triple {29867#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29868#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:02:46,707 INFO L290 TraceCheckUtils]: 55: Hoare triple {29868#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29869#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:02:46,707 INFO L290 TraceCheckUtils]: 56: Hoare triple {29869#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29870#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:02:46,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {29870#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29871#(and (<= main_~y~0 52) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:02:46,708 INFO L290 TraceCheckUtils]: 58: Hoare triple {29871#(and (<= main_~y~0 52) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {29815#false} is VALID [2022-04-28 03:02:46,708 INFO L272 TraceCheckUtils]: 59: Hoare triple {29815#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {29815#false} is VALID [2022-04-28 03:02:46,708 INFO L290 TraceCheckUtils]: 60: Hoare triple {29815#false} ~cond := #in~cond; {29815#false} is VALID [2022-04-28 03:02:46,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {29815#false} assume 0 == ~cond; {29815#false} is VALID [2022-04-28 03:02:46,708 INFO L290 TraceCheckUtils]: 62: Hoare triple {29815#false} assume !false; {29815#false} is VALID [2022-04-28 03:02:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:46,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:46,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877096157] [2022-04-28 03:02:46,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877096157] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:46,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082259722] [2022-04-28 03:02:46,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:02:46,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:46,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:46,710 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:46,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-28 03:02:46,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:02:46,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:46,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 107 conjunts are in the unsatisfiable core [2022-04-28 03:02:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:46,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:47,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {29814#true} call ULTIMATE.init(); {29814#true} is VALID [2022-04-28 03:02:47,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {29814#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(12, 2);call #Ultimate.allocInit(12, 3); {29814#true} is VALID [2022-04-28 03:02:47,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {29814#true} assume true; {29814#true} is VALID [2022-04-28 03:02:47,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29814#true} {29814#true} #34#return; {29814#true} is VALID [2022-04-28 03:02:47,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {29814#true} call #t~ret5 := main(); {29814#true} is VALID [2022-04-28 03:02:47,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {29814#true} ~x~0 := 1;~y~0 := 0; {29819#(= main_~y~0 0)} is VALID [2022-04-28 03:02:47,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {29819#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29820#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:02:47,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {29820#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29821#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:02:47,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {29821#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29822#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:02:47,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {29822#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29823#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:02:47,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {29823#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29824#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:02:47,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {29824#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29825#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:02:47,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {29825#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29826#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:02:47,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {29826#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29827#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:02:47,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {29827#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29828#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:02:47,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {29828#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29829#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:02:47,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {29829#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29830#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:02:47,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {29830#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29831#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:02:47,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {29831#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29832#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:02:47,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {29832#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29833#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:02:47,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {29833#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29834#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:02:47,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {29834#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29835#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:02:47,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {29835#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29836#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:02:47,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {29836#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29837#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:02:47,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {29837#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29838#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:02:47,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {29838#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29839#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:02:47,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {29839#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29840#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:02:47,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {29840#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29841#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:02:47,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {29841#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29842#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:02:47,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {29842#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29843#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:02:47,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {29843#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29844#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:02:47,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {29844#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29845#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:02:47,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {29845#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29846#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:02:47,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {29846#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29847#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:02:47,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {29847#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29848#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:02:47,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {29848#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29849#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:02:47,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {29849#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29850#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:02:47,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {29850#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29851#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:02:47,443 INFO L290 TraceCheckUtils]: 38: Hoare triple {29851#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29852#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:02:47,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {29852#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29853#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:02:47,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {29853#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29854#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:02:47,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {29854#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29855#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:02:47,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {29855#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29856#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:02:47,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {29856#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29857#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:02:47,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {29857#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29858#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:02:47,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {29858#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29859#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:02:47,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {29859#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29860#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:02:47,447 INFO L290 TraceCheckUtils]: 47: Hoare triple {29860#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29861#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:02:47,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {29861#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29862#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:02:47,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {29862#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29863#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:02:47,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {29863#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29864#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:02:47,449 INFO L290 TraceCheckUtils]: 51: Hoare triple {29864#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29865#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:02:47,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {29865#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29866#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:02:47,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {29866#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29867#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:02:47,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {29867#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29868#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:02:47,451 INFO L290 TraceCheckUtils]: 55: Hoare triple {29868#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29869#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:02:47,451 INFO L290 TraceCheckUtils]: 56: Hoare triple {29869#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {29870#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:02:47,452 INFO L290 TraceCheckUtils]: 57: Hoare triple {29870#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30047#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:02:47,452 INFO L290 TraceCheckUtils]: 58: Hoare triple {30047#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {29815#false} is VALID [2022-04-28 03:02:47,452 INFO L272 TraceCheckUtils]: 59: Hoare triple {29815#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {29815#false} is VALID [2022-04-28 03:02:47,452 INFO L290 TraceCheckUtils]: 60: Hoare triple {29815#false} ~cond := #in~cond; {29815#false} is VALID [2022-04-28 03:02:47,452 INFO L290 TraceCheckUtils]: 61: Hoare triple {29815#false} assume 0 == ~cond; {29815#false} is VALID [2022-04-28 03:02:47,452 INFO L290 TraceCheckUtils]: 62: Hoare triple {29815#false} assume !false; {29815#false} is VALID [2022-04-28 03:02:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:47,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:51,551 INFO L290 TraceCheckUtils]: 62: Hoare triple {29815#false} assume !false; {29815#false} is VALID [2022-04-28 03:02:51,551 INFO L290 TraceCheckUtils]: 61: Hoare triple {29815#false} assume 0 == ~cond; {29815#false} is VALID [2022-04-28 03:02:51,551 INFO L290 TraceCheckUtils]: 60: Hoare triple {29815#false} ~cond := #in~cond; {29815#false} is VALID [2022-04-28 03:02:51,552 INFO L272 TraceCheckUtils]: 59: Hoare triple {29815#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {29815#false} is VALID [2022-04-28 03:02:51,552 INFO L290 TraceCheckUtils]: 58: Hoare triple {30075#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {29815#false} is VALID [2022-04-28 03:02:51,553 INFO L290 TraceCheckUtils]: 57: Hoare triple {30079#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30075#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:02:51,553 INFO L290 TraceCheckUtils]: 56: Hoare triple {30083#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30079#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {30087#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30083#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {30091#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30087#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,555 INFO L290 TraceCheckUtils]: 53: Hoare triple {30095#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30091#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,556 INFO L290 TraceCheckUtils]: 52: Hoare triple {30099#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30095#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,556 INFO L290 TraceCheckUtils]: 51: Hoare triple {30103#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30099#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {30107#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30103#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {30111#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30107#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,558 INFO L290 TraceCheckUtils]: 48: Hoare triple {30115#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30111#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {30119#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30115#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {30123#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30119#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,560 INFO L290 TraceCheckUtils]: 45: Hoare triple {30127#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30123#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {30131#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30127#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {30135#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30131#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {30139#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30135#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {30143#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30139#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {30147#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30143#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {30151#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30147#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {30155#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30151#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {30159#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30155#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {30163#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30159#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {30167#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30163#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {30171#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30167#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {30175#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30171#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {30179#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30175#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {30183#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30179#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {30187#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30183#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {30191#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30187#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {30195#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30191#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {30199#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30195#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {30203#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30199#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {30207#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30203#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {30211#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30207#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {30215#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30211#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {30219#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30215#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {30223#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30219#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {30227#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30223#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {30231#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30227#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {30235#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30231#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {30239#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30235#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {30243#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30239#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {30247#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30243#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {30251#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30247#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {30255#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30251#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {30259#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30255#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {30263#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30259#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {30267#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30263#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {30271#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30267#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {30275#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30271#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {30279#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30275#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {30283#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30279#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {29814#true} ~x~0 := 1;~y~0 := 0; {30283#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:02:51,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {29814#true} call #t~ret5 := main(); {29814#true} is VALID [2022-04-28 03:02:51,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29814#true} {29814#true} #34#return; {29814#true} is VALID [2022-04-28 03:02:51,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {29814#true} assume true; {29814#true} is VALID [2022-04-28 03:02:51,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {29814#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(12, 2);call #Ultimate.allocInit(12, 3); {29814#true} is VALID [2022-04-28 03:02:51,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {29814#true} call ULTIMATE.init(); {29814#true} is VALID [2022-04-28 03:02:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:51,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082259722] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:51,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:51,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 110 [2022-04-28 03:02:51,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:51,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1857204992] [2022-04-28 03:02:51,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1857204992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:51,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:51,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 03:02:51,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451361166] [2022-04-28 03:02:51,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:51,589 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 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 63 [2022-04-28 03:02:51,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:51,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 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-28 03:02:51,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:51,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 03:02:51,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:51,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 03:02:51,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3132, Invalid=8858, Unknown=0, NotChecked=0, Total=11990 [2022-04-28 03:02:51,622 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 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-28 03:02:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:56,809 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 03:02:56,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-28 03:02:56,809 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 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 63 [2022-04-28 03:02:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 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-28 03:02:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-28 03:02:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 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-28 03:02:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-28 03:02:56,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-28 03:02:56,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:56,995 INFO L225 Difference]: With dead ends: 70 [2022-04-28 03:02:56,995 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 03:02:56,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=6257, Invalid=20149, Unknown=0, NotChecked=0, Total=26406 [2022-04-28 03:02:56,997 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:56,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:02:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 03:02:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 03:02:57,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:57,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:57,077 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:57,077 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:57,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:57,078 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 03:02:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 03:02:57,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:57,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:57,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 03:02:57,078 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 03:02:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:57,079 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 03:02:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 03:02:57,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:57,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:57,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:57,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-04-28 03:02:57,080 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2022-04-28 03:02:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:57,080 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-04-28 03:02:57,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 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-28 03:02:57,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 65 transitions. [2022-04-28 03:02:57,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 03:02:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 03:02:57,129 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:57,129 INFO L195 NwaCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:57,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:57,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104,SelfDestructingSolverStorable105 [2022-04-28 03:02:57,343 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:57,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:57,344 INFO L85 PathProgramCache]: Analyzing trace with hash 197834230, now seen corresponding path program 105 times [2022-04-28 03:02:57,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:57,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [750289565] [2022-04-28 03:02:59,055 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:02:59,199 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:02:59,200 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:59,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1206170103, now seen corresponding path program 1 times [2022-04-28 03:02:59,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:59,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38126534] [2022-04-28 03:02:59,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:59,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:59,210 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:59,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash 197834230, now seen corresponding path program 106 times [2022-04-28 03:02:59,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:59,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205447049] [2022-04-28 03:02:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:59,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:00,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {30869#(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(12, 2);call #Ultimate.allocInit(12, 3); {30810#true} is VALID [2022-04-28 03:03:00,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {30810#true} assume true; {30810#true} is VALID [2022-04-28 03:03:00,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30810#true} {30810#true} #34#return; {30810#true} is VALID [2022-04-28 03:03:00,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {30810#true} call ULTIMATE.init(); {30869#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:00,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {30869#(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(12, 2);call #Ultimate.allocInit(12, 3); {30810#true} is VALID [2022-04-28 03:03:00,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {30810#true} assume true; {30810#true} is VALID [2022-04-28 03:03:00,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30810#true} {30810#true} #34#return; {30810#true} is VALID [2022-04-28 03:03:00,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {30810#true} call #t~ret5 := main(); {30810#true} is VALID [2022-04-28 03:03:00,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {30810#true} ~x~0 := 1;~y~0 := 0; {30815#(= main_~y~0 0)} is VALID [2022-04-28 03:03:00,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {30815#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30816#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:03:00,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {30816#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30817#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:03:00,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {30817#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30818#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:03:00,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {30818#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30819#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:03:00,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {30819#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30820#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:03:00,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {30820#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30821#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:03:00,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {30821#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30822#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:03:00,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {30822#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30823#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:03:00,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {30823#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30824#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:03:00,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {30824#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30825#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:03:00,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {30825#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30826#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:03:00,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {30826#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30827#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:03:00,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {30827#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30828#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:03:00,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {30828#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30829#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:03:00,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {30829#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30830#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:03:00,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {30830#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30831#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:03:00,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {30831#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30832#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:03:00,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {30832#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30833#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:03:00,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {30833#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30834#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:03:00,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {30834#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30835#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:03:00,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {30835#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30836#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:03:00,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {30836#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30837#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:03:00,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {30837#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30838#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:03:00,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {30838#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30839#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:03:00,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {30839#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30840#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:03:00,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {30840#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30841#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:03:00,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {30841#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30842#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:03:00,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {30842#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30843#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:03:00,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {30843#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30844#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:03:00,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {30844#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30845#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:03:00,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {30845#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30846#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:03:00,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {30846#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30847#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:03:00,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {30847#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30848#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:03:00,628 INFO L290 TraceCheckUtils]: 39: Hoare triple {30848#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30849#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:03:00,628 INFO L290 TraceCheckUtils]: 40: Hoare triple {30849#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30850#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:03:00,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {30850#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30851#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:03:00,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {30851#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30852#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:03:00,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {30852#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30853#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:03:00,630 INFO L290 TraceCheckUtils]: 44: Hoare triple {30853#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30854#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:03:00,630 INFO L290 TraceCheckUtils]: 45: Hoare triple {30854#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30855#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:03:00,631 INFO L290 TraceCheckUtils]: 46: Hoare triple {30855#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30856#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:03:00,631 INFO L290 TraceCheckUtils]: 47: Hoare triple {30856#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30857#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:03:00,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {30857#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30858#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:03:00,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {30858#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30859#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:03:00,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {30859#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30860#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:03:00,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {30860#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30861#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:03:00,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {30861#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30862#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:03:00,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {30862#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30863#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:03:00,635 INFO L290 TraceCheckUtils]: 54: Hoare triple {30863#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30864#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:03:00,635 INFO L290 TraceCheckUtils]: 55: Hoare triple {30864#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30865#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:03:00,636 INFO L290 TraceCheckUtils]: 56: Hoare triple {30865#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30866#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:03:00,636 INFO L290 TraceCheckUtils]: 57: Hoare triple {30866#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30867#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:03:00,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {30867#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30868#(and (<= main_~y~0 53) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:03:00,637 INFO L290 TraceCheckUtils]: 59: Hoare triple {30868#(and (<= main_~y~0 53) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {30811#false} is VALID [2022-04-28 03:03:00,637 INFO L272 TraceCheckUtils]: 60: Hoare triple {30811#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {30811#false} is VALID [2022-04-28 03:03:00,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {30811#false} ~cond := #in~cond; {30811#false} is VALID [2022-04-28 03:03:00,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {30811#false} assume 0 == ~cond; {30811#false} is VALID [2022-04-28 03:03:00,637 INFO L290 TraceCheckUtils]: 63: Hoare triple {30811#false} assume !false; {30811#false} is VALID [2022-04-28 03:03:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:00,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:00,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205447049] [2022-04-28 03:03:00,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205447049] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:00,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642678420] [2022-04-28 03:03:00,638 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:03:00,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:00,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:00,639 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:00,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-28 03:03:00,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:03:00,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:00,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 109 conjunts are in the unsatisfiable core [2022-04-28 03:03:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:00,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:01,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {30810#true} call ULTIMATE.init(); {30810#true} is VALID [2022-04-28 03:03:01,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {30810#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(12, 2);call #Ultimate.allocInit(12, 3); {30810#true} is VALID [2022-04-28 03:03:01,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {30810#true} assume true; {30810#true} is VALID [2022-04-28 03:03:01,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30810#true} {30810#true} #34#return; {30810#true} is VALID [2022-04-28 03:03:01,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {30810#true} call #t~ret5 := main(); {30810#true} is VALID [2022-04-28 03:03:01,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {30810#true} ~x~0 := 1;~y~0 := 0; {30815#(= main_~y~0 0)} is VALID [2022-04-28 03:03:01,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {30815#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30816#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:03:01,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {30816#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30817#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:03:01,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {30817#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30818#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:03:01,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {30818#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30819#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:03:01,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {30819#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30820#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:03:01,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {30820#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30821#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:03:01,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {30821#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30822#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:03:01,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {30822#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30823#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:03:01,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {30823#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30824#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:03:01,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {30824#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30825#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:03:01,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {30825#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30826#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:03:01,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {30826#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30827#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:03:01,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {30827#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30828#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:03:01,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {30828#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30829#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:03:01,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {30829#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30830#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:03:01,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {30830#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30831#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:03:01,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {30831#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30832#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:03:01,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {30832#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30833#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:03:01,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {30833#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30834#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:03:01,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {30834#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30835#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:03:01,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {30835#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30836#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:03:01,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {30836#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30837#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:03:01,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {30837#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30838#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:03:01,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {30838#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30839#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:03:01,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {30839#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30840#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:03:01,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {30840#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30841#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:03:01,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {30841#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30842#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:03:01,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {30842#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30843#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:03:01,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {30843#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30844#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:03:01,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {30844#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30845#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:03:01,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {30845#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30846#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:03:01,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {30846#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30847#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:03:01,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {30847#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30848#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:03:01,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {30848#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30849#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:03:01,357 INFO L290 TraceCheckUtils]: 40: Hoare triple {30849#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30850#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:03:01,357 INFO L290 TraceCheckUtils]: 41: Hoare triple {30850#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30851#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:03:01,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {30851#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30852#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:03:01,358 INFO L290 TraceCheckUtils]: 43: Hoare triple {30852#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30853#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:03:01,359 INFO L290 TraceCheckUtils]: 44: Hoare triple {30853#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30854#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:03:01,359 INFO L290 TraceCheckUtils]: 45: Hoare triple {30854#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30855#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:03:01,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {30855#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30856#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:03:01,360 INFO L290 TraceCheckUtils]: 47: Hoare triple {30856#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30857#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:03:01,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {30857#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30858#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:03:01,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {30858#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30859#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:03:01,362 INFO L290 TraceCheckUtils]: 50: Hoare triple {30859#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30860#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:03:01,362 INFO L290 TraceCheckUtils]: 51: Hoare triple {30860#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30861#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:03:01,363 INFO L290 TraceCheckUtils]: 52: Hoare triple {30861#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30862#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:03:01,363 INFO L290 TraceCheckUtils]: 53: Hoare triple {30862#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30863#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:03:01,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {30863#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30864#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:03:01,364 INFO L290 TraceCheckUtils]: 55: Hoare triple {30864#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30865#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:03:01,365 INFO L290 TraceCheckUtils]: 56: Hoare triple {30865#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30866#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:03:01,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {30866#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {30867#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:03:01,366 INFO L290 TraceCheckUtils]: 58: Hoare triple {30867#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31047#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:03:01,366 INFO L290 TraceCheckUtils]: 59: Hoare triple {31047#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {30811#false} is VALID [2022-04-28 03:03:01,366 INFO L272 TraceCheckUtils]: 60: Hoare triple {30811#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {30811#false} is VALID [2022-04-28 03:03:01,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {30811#false} ~cond := #in~cond; {30811#false} is VALID [2022-04-28 03:03:01,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {30811#false} assume 0 == ~cond; {30811#false} is VALID [2022-04-28 03:03:01,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {30811#false} assume !false; {30811#false} is VALID [2022-04-28 03:03:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:01,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:05,587 INFO L290 TraceCheckUtils]: 63: Hoare triple {30811#false} assume !false; {30811#false} is VALID [2022-04-28 03:03:05,587 INFO L290 TraceCheckUtils]: 62: Hoare triple {30811#false} assume 0 == ~cond; {30811#false} is VALID [2022-04-28 03:03:05,587 INFO L290 TraceCheckUtils]: 61: Hoare triple {30811#false} ~cond := #in~cond; {30811#false} is VALID [2022-04-28 03:03:05,587 INFO L272 TraceCheckUtils]: 60: Hoare triple {30811#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {30811#false} is VALID [2022-04-28 03:03:05,587 INFO L290 TraceCheckUtils]: 59: Hoare triple {31075#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {30811#false} is VALID [2022-04-28 03:03:05,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {31079#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31075#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:03:05,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {31083#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31079#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,590 INFO L290 TraceCheckUtils]: 56: Hoare triple {31087#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31083#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,590 INFO L290 TraceCheckUtils]: 55: Hoare triple {31091#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31087#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {31095#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31091#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {31099#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31095#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {31103#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31099#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {31107#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31103#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,594 INFO L290 TraceCheckUtils]: 50: Hoare triple {31111#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31107#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {31115#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31111#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {31119#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31115#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {31123#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31119#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {31127#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31123#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {31131#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31127#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {31135#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31131#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {31139#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31135#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {31143#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31139#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {31147#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31143#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {31151#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31147#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {31155#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31151#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {31159#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31155#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {31163#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31159#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {31167#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31163#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {31171#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31167#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {31175#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31171#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {31179#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31175#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {31183#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31179#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {31187#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31183#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {31191#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31187#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {31195#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31191#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {31199#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31195#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {31203#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31199#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {31207#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31203#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {31211#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31207#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {31215#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31211#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {31219#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31215#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {31223#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31219#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {31227#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31223#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {31231#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31227#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {31235#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31231#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {31239#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31235#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {31243#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31239#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {31247#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31243#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {31251#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31247#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {31255#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31251#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {31259#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31255#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {31263#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31259#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {31267#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31263#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {31271#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31267#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {31275#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31271#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {31279#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31275#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {31283#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31279#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {31287#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31283#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {30810#true} ~x~0 := 1;~y~0 := 0; {31287#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:03:05,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {30810#true} call #t~ret5 := main(); {30810#true} is VALID [2022-04-28 03:03:05,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30810#true} {30810#true} #34#return; {30810#true} is VALID [2022-04-28 03:03:05,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {30810#true} assume true; {30810#true} is VALID [2022-04-28 03:03:05,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {30810#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(12, 2);call #Ultimate.allocInit(12, 3); {30810#true} is VALID [2022-04-28 03:03:05,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {30810#true} call ULTIMATE.init(); {30810#true} is VALID [2022-04-28 03:03:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:05,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642678420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:05,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:05,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 112 [2022-04-28 03:03:05,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:05,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [750289565] [2022-04-28 03:03:05,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [750289565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:05,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:05,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-28 03:03:05,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283717508] [2022-04-28 03:03:05,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:05,625 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 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 64 [2022-04-28 03:03:05,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:05,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 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-28 03:03:05,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:05,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-28 03:03:05,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:05,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-28 03:03:05,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=9187, Unknown=0, NotChecked=0, Total=12432 [2022-04-28 03:03:05,658 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 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-28 03:03:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:11,191 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 03:03:11,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 03:03:11,191 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 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 64 [2022-04-28 03:03:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 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-28 03:03:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-28 03:03:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 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-28 03:03:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-28 03:03:11,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 71 transitions. [2022-04-28 03:03:11,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:11,234 INFO L225 Difference]: With dead ends: 71 [2022-04-28 03:03:11,234 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 03:03:11,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=6483, Invalid=20907, Unknown=0, NotChecked=0, Total=27390 [2022-04-28 03:03:11,235 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2994 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:11,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 143 Invalid, 3103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2994 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 03:03:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 03:03:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-28 03:03:11,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:11,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 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-28 03:03:11,303 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 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-28 03:03:11,303 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 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-28 03:03:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:11,309 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 03:03:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 03:03:11,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:11,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:11,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 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 66 states. [2022-04-28 03:03:11,310 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 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 66 states. [2022-04-28 03:03:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:11,310 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 03:03:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 03:03:11,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:11,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:11,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:11,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 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-28 03:03:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2022-04-28 03:03:11,311 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2022-04-28 03:03:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:11,311 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2022-04-28 03:03:11,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 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-28 03:03:11,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 66 transitions. [2022-04-28 03:03:11,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 03:03:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 03:03:11,359 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:11,359 INFO L195 NwaCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:11,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:11,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106,SelfDestructingSolverStorable107 [2022-04-28 03:03:11,559 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1874355100, now seen corresponding path program 107 times [2022-04-28 03:03:11,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:11,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [207443927] [2022-04-28 03:03:11,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:03:11,820 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1265275447, now seen corresponding path program 1 times [2022-04-28 03:03:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:11,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686294286] [2022-04-28 03:03:11,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:11,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:11,826 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:11,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1874355100, now seen corresponding path program 108 times [2022-04-28 03:03:11,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:11,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402263020] [2022-04-28 03:03:11,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:13,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:13,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {31882#(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(12, 2);call #Ultimate.allocInit(12, 3); {31822#true} is VALID [2022-04-28 03:03:13,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {31822#true} assume true; {31822#true} is VALID [2022-04-28 03:03:13,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31822#true} {31822#true} #34#return; {31822#true} is VALID [2022-04-28 03:03:13,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {31822#true} call ULTIMATE.init(); {31882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:13,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {31882#(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(12, 2);call #Ultimate.allocInit(12, 3); {31822#true} is VALID [2022-04-28 03:03:13,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {31822#true} assume true; {31822#true} is VALID [2022-04-28 03:03:13,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31822#true} {31822#true} #34#return; {31822#true} is VALID [2022-04-28 03:03:13,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {31822#true} call #t~ret5 := main(); {31822#true} is VALID [2022-04-28 03:03:13,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {31822#true} ~x~0 := 1;~y~0 := 0; {31827#(= main_~y~0 0)} is VALID [2022-04-28 03:03:13,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {31827#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:03:13,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {31828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:03:13,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {31829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:03:13,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {31830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31831#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:03:13,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {31831#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31832#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:03:13,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {31832#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31833#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:03:13,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {31833#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31834#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:03:13,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {31834#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31835#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:03:13,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {31835#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31836#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:03:13,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {31836#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31837#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:03:13,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {31837#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31838#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:03:13,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {31838#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31839#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:03:13,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {31839#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31840#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:03:13,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {31840#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31841#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:03:13,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {31841#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31842#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:03:13,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {31842#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31843#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:03:13,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {31843#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31844#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:03:13,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {31844#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31845#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:03:13,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {31845#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31846#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:03:13,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {31846#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31847#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:03:13,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {31847#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31848#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:03:13,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {31848#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31849#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:03:13,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {31849#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31850#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:03:13,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {31850#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31851#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:03:13,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {31851#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31852#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:03:13,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {31852#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31853#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:03:13,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {31853#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31854#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:03:13,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {31854#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31855#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:03:13,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {31855#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31856#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:03:13,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {31856#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31857#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:03:13,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {31857#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31858#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:03:13,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {31858#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31859#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:03:13,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {31859#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31860#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:03:13,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {31860#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31861#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:03:13,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {31861#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31862#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:03:13,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {31862#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31863#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:03:13,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {31863#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31864#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:03:13,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {31864#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31865#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:03:13,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {31865#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31866#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:03:13,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {31866#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31867#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:03:13,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {31867#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31868#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:03:13,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {31868#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31869#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:03:13,313 INFO L290 TraceCheckUtils]: 48: Hoare triple {31869#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31870#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:03:13,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {31870#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31871#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:03:13,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {31871#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31872#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:03:13,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {31872#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31873#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:03:13,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {31873#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31874#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:03:13,316 INFO L290 TraceCheckUtils]: 53: Hoare triple {31874#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31875#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:03:13,316 INFO L290 TraceCheckUtils]: 54: Hoare triple {31875#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31876#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:03:13,317 INFO L290 TraceCheckUtils]: 55: Hoare triple {31876#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31877#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:03:13,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {31877#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31878#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:03:13,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {31878#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31879#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:03:13,318 INFO L290 TraceCheckUtils]: 58: Hoare triple {31879#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31880#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:03:13,318 INFO L290 TraceCheckUtils]: 59: Hoare triple {31880#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31881#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 54))} is VALID [2022-04-28 03:03:13,319 INFO L290 TraceCheckUtils]: 60: Hoare triple {31881#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 54))} assume !(~y~0 % 4294967296 < 1024); {31823#false} is VALID [2022-04-28 03:03:13,319 INFO L272 TraceCheckUtils]: 61: Hoare triple {31823#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {31823#false} is VALID [2022-04-28 03:03:13,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {31823#false} ~cond := #in~cond; {31823#false} is VALID [2022-04-28 03:03:13,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {31823#false} assume 0 == ~cond; {31823#false} is VALID [2022-04-28 03:03:13,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {31823#false} assume !false; {31823#false} is VALID [2022-04-28 03:03:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:13,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:13,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402263020] [2022-04-28 03:03:13,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402263020] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:13,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600341589] [2022-04-28 03:03:13,320 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:03:13,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:13,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:13,321 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:13,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-28 03:03:34,678 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-28 03:03:34,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:34,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-28 03:03:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:34,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:35,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {31822#true} call ULTIMATE.init(); {31822#true} is VALID [2022-04-28 03:03:35,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {31822#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(12, 2);call #Ultimate.allocInit(12, 3); {31822#true} is VALID [2022-04-28 03:03:35,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {31822#true} assume true; {31822#true} is VALID [2022-04-28 03:03:35,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31822#true} {31822#true} #34#return; {31822#true} is VALID [2022-04-28 03:03:35,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {31822#true} call #t~ret5 := main(); {31822#true} is VALID [2022-04-28 03:03:35,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {31822#true} ~x~0 := 1;~y~0 := 0; {31827#(= main_~y~0 0)} is VALID [2022-04-28 03:03:35,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {31827#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:03:35,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {31828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:03:35,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {31829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:03:35,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {31830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31831#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:03:35,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {31831#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31832#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:03:35,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {31832#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31833#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:03:35,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {31833#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31834#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:03:35,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {31834#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31835#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:03:35,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {31835#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31836#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:03:35,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {31836#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31837#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:03:35,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {31837#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31838#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:03:35,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {31838#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31839#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:03:35,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {31839#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31840#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:03:35,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {31840#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31841#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:03:35,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {31841#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31842#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:03:35,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {31842#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31843#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:03:35,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {31843#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31844#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:03:35,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {31844#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31845#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:03:35,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {31845#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31846#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:03:35,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {31846#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31847#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:03:35,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {31847#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31848#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:03:35,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {31848#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31849#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:03:35,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {31849#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31850#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:03:35,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {31850#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31851#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:03:35,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {31851#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31852#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:03:35,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {31852#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31853#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:03:35,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {31853#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31854#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:03:35,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {31854#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31855#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:03:35,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {31855#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31856#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:03:35,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {31856#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31857#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:03:35,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {31857#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31858#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:03:35,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {31858#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31859#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:03:35,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {31859#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31860#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:03:35,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {31860#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31861#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:03:35,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {31861#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31862#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:03:35,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {31862#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31863#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:03:35,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {31863#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31864#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:03:35,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {31864#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31865#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:03:35,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {31865#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31866#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:03:35,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {31866#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31867#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:03:35,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {31867#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31868#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:03:35,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {31868#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31869#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:03:35,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {31869#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31870#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:03:35,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {31870#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31871#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:03:35,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {31871#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31872#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:03:35,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {31872#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31873#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:03:35,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {31873#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31874#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:03:35,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {31874#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31875#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:03:35,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {31875#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31876#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:03:35,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {31876#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31877#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:03:35,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {31877#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31878#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:03:35,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {31878#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31879#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:03:35,322 INFO L290 TraceCheckUtils]: 58: Hoare triple {31879#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {31880#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:03:35,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {31880#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32063#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:03:35,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {32063#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !(~y~0 % 4294967296 < 1024); {31823#false} is VALID [2022-04-28 03:03:35,323 INFO L272 TraceCheckUtils]: 61: Hoare triple {31823#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {31823#false} is VALID [2022-04-28 03:03:35,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {31823#false} ~cond := #in~cond; {31823#false} is VALID [2022-04-28 03:03:35,323 INFO L290 TraceCheckUtils]: 63: Hoare triple {31823#false} assume 0 == ~cond; {31823#false} is VALID [2022-04-28 03:03:35,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {31823#false} assume !false; {31823#false} is VALID [2022-04-28 03:03:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:35,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:47,742 INFO L290 TraceCheckUtils]: 64: Hoare triple {31823#false} assume !false; {31823#false} is VALID [2022-04-28 03:03:47,742 INFO L290 TraceCheckUtils]: 63: Hoare triple {31823#false} assume 0 == ~cond; {31823#false} is VALID [2022-04-28 03:03:47,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {31823#false} ~cond := #in~cond; {31823#false} is VALID [2022-04-28 03:03:47,743 INFO L272 TraceCheckUtils]: 61: Hoare triple {31823#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {31823#false} is VALID [2022-04-28 03:03:47,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {32091#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {31823#false} is VALID [2022-04-28 03:03:47,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {32095#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32091#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:03:47,745 INFO L290 TraceCheckUtils]: 58: Hoare triple {32099#(or (< (mod (+ main_~y~0 2) 4294967296) 1024) (not (< (mod main_~y~0 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32095#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:03:47,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {32103#(or (not (< (mod (+ main_~y~0 1) 4294967296) 1024)) (< (mod (+ main_~y~0 3) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32099#(or (< (mod (+ main_~y~0 2) 4294967296) 1024) (not (< (mod main_~y~0 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {32107#(or (< (mod (+ main_~y~0 4) 4294967296) 1024) (not (< (mod (+ main_~y~0 2) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32103#(or (not (< (mod (+ main_~y~0 1) 4294967296) 1024)) (< (mod (+ main_~y~0 3) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {32111#(or (not (< (mod (+ main_~y~0 3) 4294967296) 1024)) (< (mod (+ 5 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32107#(or (< (mod (+ main_~y~0 4) 4294967296) 1024) (not (< (mod (+ main_~y~0 2) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {32115#(or (not (< (mod (+ main_~y~0 4) 4294967296) 1024)) (< (mod (+ main_~y~0 6) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32111#(or (not (< (mod (+ main_~y~0 3) 4294967296) 1024)) (< (mod (+ 5 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {32119#(or (< (mod (+ 7 main_~y~0) 4294967296) 1024) (not (< (mod (+ 5 main_~y~0) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32115#(or (not (< (mod (+ main_~y~0 4) 4294967296) 1024)) (< (mod (+ main_~y~0 6) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {32123#(or (< (mod (+ main_~y~0 8) 4294967296) 1024) (not (< (mod (+ main_~y~0 6) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32119#(or (< (mod (+ 7 main_~y~0) 4294967296) 1024) (not (< (mod (+ 5 main_~y~0) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {32127#(or (not (< (mod (+ 7 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 9) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32123#(or (< (mod (+ main_~y~0 8) 4294967296) 1024) (not (< (mod (+ main_~y~0 6) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {32131#(or (< (mod (+ main_~y~0 10) 4294967296) 1024) (not (< (mod (+ main_~y~0 8) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32127#(or (not (< (mod (+ 7 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 9) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,752 INFO L290 TraceCheckUtils]: 49: Hoare triple {32135#(or (not (< (mod (+ main_~y~0 9) 4294967296) 1024)) (< (mod (+ main_~y~0 11) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32131#(or (< (mod (+ main_~y~0 10) 4294967296) 1024) (not (< (mod (+ main_~y~0 8) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {32139#(or (not (< (mod (+ main_~y~0 10) 4294967296) 1024)) (< (mod (+ main_~y~0 12) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32135#(or (not (< (mod (+ main_~y~0 9) 4294967296) 1024)) (< (mod (+ main_~y~0 11) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {32143#(or (< (mod (+ main_~y~0 13) 4294967296) 1024) (not (< (mod (+ main_~y~0 11) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32139#(or (not (< (mod (+ main_~y~0 10) 4294967296) 1024)) (< (mod (+ main_~y~0 12) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,755 INFO L290 TraceCheckUtils]: 46: Hoare triple {32147#(or (< (mod (+ main_~y~0 14) 4294967296) 1024) (not (< (mod (+ main_~y~0 12) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32143#(or (< (mod (+ main_~y~0 13) 4294967296) 1024) (not (< (mod (+ main_~y~0 11) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {32151#(or (< (mod (+ main_~y~0 15) 4294967296) 1024) (not (< (mod (+ main_~y~0 13) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32147#(or (< (mod (+ main_~y~0 14) 4294967296) 1024) (not (< (mod (+ main_~y~0 12) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {32155#(or (< (mod (+ main_~y~0 16) 4294967296) 1024) (not (< (mod (+ main_~y~0 14) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32151#(or (< (mod (+ main_~y~0 15) 4294967296) 1024) (not (< (mod (+ main_~y~0 13) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {32159#(or (< (mod (+ main_~y~0 17) 4294967296) 1024) (not (< (mod (+ main_~y~0 15) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32155#(or (< (mod (+ main_~y~0 16) 4294967296) 1024) (not (< (mod (+ main_~y~0 14) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {32163#(or (< (mod (+ main_~y~0 18) 4294967296) 1024) (not (< (mod (+ main_~y~0 16) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32159#(or (< (mod (+ main_~y~0 17) 4294967296) 1024) (not (< (mod (+ main_~y~0 15) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {32167#(or (not (< (mod (+ main_~y~0 17) 4294967296) 1024)) (< (mod (+ 19 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32163#(or (< (mod (+ main_~y~0 18) 4294967296) 1024) (not (< (mod (+ main_~y~0 16) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {32171#(or (< (mod (+ main_~y~0 20) 4294967296) 1024) (not (< (mod (+ main_~y~0 18) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32167#(or (not (< (mod (+ main_~y~0 17) 4294967296) 1024)) (< (mod (+ 19 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,760 INFO L290 TraceCheckUtils]: 39: Hoare triple {32175#(or (< (mod (+ main_~y~0 21) 4294967296) 1024) (not (< (mod (+ 19 main_~y~0) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32171#(or (< (mod (+ main_~y~0 20) 4294967296) 1024) (not (< (mod (+ main_~y~0 18) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {32179#(or (< (mod (+ main_~y~0 22) 4294967296) 1024) (not (< (mod (+ main_~y~0 20) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32175#(or (< (mod (+ main_~y~0 21) 4294967296) 1024) (not (< (mod (+ 19 main_~y~0) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {32183#(or (not (< (mod (+ main_~y~0 21) 4294967296) 1024)) (< (mod (+ 23 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32179#(or (< (mod (+ main_~y~0 22) 4294967296) 1024) (not (< (mod (+ main_~y~0 20) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {32187#(or (not (< (mod (+ main_~y~0 22) 4294967296) 1024)) (< (mod (+ main_~y~0 24) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32183#(or (not (< (mod (+ main_~y~0 21) 4294967296) 1024)) (< (mod (+ 23 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {32191#(or (not (< (mod (+ 23 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 25) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32187#(or (not (< (mod (+ main_~y~0 22) 4294967296) 1024)) (< (mod (+ main_~y~0 24) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {32195#(or (< (mod (+ main_~y~0 26) 4294967296) 1024) (not (< (mod (+ main_~y~0 24) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32191#(or (not (< (mod (+ 23 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 25) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {32199#(or (not (< (mod (+ main_~y~0 25) 4294967296) 1024)) (< (mod (+ main_~y~0 27) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32195#(or (< (mod (+ main_~y~0 26) 4294967296) 1024) (not (< (mod (+ main_~y~0 24) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {32203#(or (< (mod (+ main_~y~0 28) 4294967296) 1024) (not (< (mod (+ main_~y~0 26) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32199#(or (not (< (mod (+ main_~y~0 25) 4294967296) 1024)) (< (mod (+ main_~y~0 27) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {32207#(or (not (< (mod (+ main_~y~0 27) 4294967296) 1024)) (< (mod (+ 29 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32203#(or (< (mod (+ main_~y~0 28) 4294967296) 1024) (not (< (mod (+ main_~y~0 26) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {32211#(or (not (< (mod (+ main_~y~0 28) 4294967296) 1024)) (< (mod (+ 30 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32207#(or (not (< (mod (+ main_~y~0 27) 4294967296) 1024)) (< (mod (+ 29 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {32215#(or (< (mod (+ main_~y~0 31) 4294967296) 1024) (not (< (mod (+ 29 main_~y~0) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32211#(or (not (< (mod (+ main_~y~0 28) 4294967296) 1024)) (< (mod (+ 30 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {32219#(or (not (< (mod (+ 30 main_~y~0) 4294967296) 1024)) (< (mod (+ 32 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32215#(or (< (mod (+ main_~y~0 31) 4294967296) 1024) (not (< (mod (+ 29 main_~y~0) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {32223#(or (not (< (mod (+ main_~y~0 31) 4294967296) 1024)) (< (mod (+ main_~y~0 33) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32219#(or (not (< (mod (+ 30 main_~y~0) 4294967296) 1024)) (< (mod (+ 32 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {32227#(or (< (mod (+ main_~y~0 34) 4294967296) 1024) (not (< (mod (+ 32 main_~y~0) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32223#(or (not (< (mod (+ main_~y~0 31) 4294967296) 1024)) (< (mod (+ main_~y~0 33) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {32231#(or (< (mod (+ 35 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 33) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32227#(or (< (mod (+ main_~y~0 34) 4294967296) 1024) (not (< (mod (+ 32 main_~y~0) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {32235#(or (not (< (mod (+ main_~y~0 34) 4294967296) 1024)) (< (mod (+ main_~y~0 36) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32231#(or (< (mod (+ 35 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 33) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {32239#(or (not (< (mod (+ 35 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 37) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32235#(or (not (< (mod (+ main_~y~0 34) 4294967296) 1024)) (< (mod (+ main_~y~0 36) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {32243#(or (< (mod (+ main_~y~0 38) 4294967296) 1024) (not (< (mod (+ main_~y~0 36) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32239#(or (not (< (mod (+ 35 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 37) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {32247#(or (not (< (mod (+ main_~y~0 37) 4294967296) 1024)) (< (mod (+ main_~y~0 39) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32243#(or (< (mod (+ main_~y~0 38) 4294967296) 1024) (not (< (mod (+ main_~y~0 36) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {32251#(or (< (mod (+ 40 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 38) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32247#(or (not (< (mod (+ main_~y~0 37) 4294967296) 1024)) (< (mod (+ main_~y~0 39) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {32255#(or (< (mod (+ 41 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 39) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32251#(or (< (mod (+ 40 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 38) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {32259#(or (< (mod (+ 42 main_~y~0) 4294967296) 1024) (not (< (mod (+ 40 main_~y~0) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32255#(or (< (mod (+ 41 main_~y~0) 4294967296) 1024) (not (< (mod (+ main_~y~0 39) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {32263#(or (not (< (mod (+ 41 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 43) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32259#(or (< (mod (+ 42 main_~y~0) 4294967296) 1024) (not (< (mod (+ 40 main_~y~0) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {32267#(or (< (mod (+ 44 main_~y~0) 4294967296) 1024) (not (< (mod (+ 42 main_~y~0) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32263#(or (not (< (mod (+ 41 main_~y~0) 4294967296) 1024)) (< (mod (+ main_~y~0 43) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {32271#(or (< (mod (+ main_~y~0 45) 4294967296) 1024) (not (< (mod (+ main_~y~0 43) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32267#(or (< (mod (+ 44 main_~y~0) 4294967296) 1024) (not (< (mod (+ 42 main_~y~0) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {32275#(or (< (mod (+ main_~y~0 46) 4294967296) 1024) (not (< (mod (+ 44 main_~y~0) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32271#(or (< (mod (+ main_~y~0 45) 4294967296) 1024) (not (< (mod (+ main_~y~0 43) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {32279#(or (not (< (mod (+ main_~y~0 45) 4294967296) 1024)) (< (mod (+ main_~y~0 47) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32275#(or (< (mod (+ main_~y~0 46) 4294967296) 1024) (not (< (mod (+ 44 main_~y~0) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {32283#(or (not (< (mod (+ main_~y~0 46) 4294967296) 1024)) (< (mod (+ main_~y~0 48) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32279#(or (not (< (mod (+ main_~y~0 45) 4294967296) 1024)) (< (mod (+ main_~y~0 47) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {32287#(or (not (< (mod (+ main_~y~0 47) 4294967296) 1024)) (< (mod (+ 49 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32283#(or (not (< (mod (+ main_~y~0 46) 4294967296) 1024)) (< (mod (+ main_~y~0 48) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {32291#(or (not (< (mod (+ main_~y~0 48) 4294967296) 1024)) (< (mod (+ main_~y~0 50) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32287#(or (not (< (mod (+ main_~y~0 47) 4294967296) 1024)) (< (mod (+ 49 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {32295#(or (not (< (mod (+ 49 main_~y~0) 4294967296) 1024)) (< (mod (+ 51 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32291#(or (not (< (mod (+ main_~y~0 48) 4294967296) 1024)) (< (mod (+ main_~y~0 50) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {32299#(or (< (mod (+ main_~y~0 52) 4294967296) 1024) (not (< (mod (+ main_~y~0 50) 4294967296) 1024)))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32295#(or (not (< (mod (+ 49 main_~y~0) 4294967296) 1024)) (< (mod (+ 51 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {32303#(or (not (< (mod (+ 51 main_~y~0) 4294967296) 1024)) (< (mod (+ 53 main_~y~0) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32299#(or (< (mod (+ main_~y~0 52) 4294967296) 1024) (not (< (mod (+ main_~y~0 50) 4294967296) 1024)))} is VALID [2022-04-28 03:03:47,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {32307#(or (not (< (mod (+ main_~y~0 52) 4294967296) 1024)) (< (mod (+ main_~y~0 54) 4294967296) 1024))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32303#(or (not (< (mod (+ 51 main_~y~0) 4294967296) 1024)) (< (mod (+ 53 main_~y~0) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {31822#true} ~x~0 := 1;~y~0 := 0; {32307#(or (not (< (mod (+ main_~y~0 52) 4294967296) 1024)) (< (mod (+ main_~y~0 54) 4294967296) 1024))} is VALID [2022-04-28 03:03:47,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {31822#true} call #t~ret5 := main(); {31822#true} is VALID [2022-04-28 03:03:47,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31822#true} {31822#true} #34#return; {31822#true} is VALID [2022-04-28 03:03:47,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {31822#true} assume true; {31822#true} is VALID [2022-04-28 03:03:47,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {31822#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(12, 2);call #Ultimate.allocInit(12, 3); {31822#true} is VALID [2022-04-28 03:03:47,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {31822#true} call ULTIMATE.init(); {31822#true} is VALID [2022-04-28 03:03:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:47,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600341589] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:47,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:47,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 114 [2022-04-28 03:03:47,788 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:47,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [207443927] [2022-04-28 03:03:47,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [207443927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:47,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:47,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-28 03:03:47,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610523349] [2022-04-28 03:03:47,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:47,789 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 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 65 [2022-04-28 03:03:47,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:47,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 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-28 03:03:47,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:47,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-28 03:03:47,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:47,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-28 03:03:47,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3360, Invalid=9522, Unknown=0, NotChecked=0, Total=12882 [2022-04-28 03:03:47,822 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 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-28 03:03:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:53,495 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 03:03:53,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-28 03:03:53,495 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 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 65 [2022-04-28 03:03:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 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-28 03:03:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-28 03:03:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 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-28 03:03:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-28 03:03:53,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 72 transitions. [2022-04-28 03:03:53,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:53,546 INFO L225 Difference]: With dead ends: 72 [2022-04-28 03:03:53,547 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 03:03:53,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=6713, Invalid=21679, Unknown=0, NotChecked=0, Total=28392 [2022-04-28 03:03:53,548 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 3077 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:53,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3077 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:03:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 03:03:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 03:03:53,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:53,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 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-28 03:03:53,616 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 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-28 03:03:53,616 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 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-28 03:03:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:53,627 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 03:03:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 03:03:53,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:53,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:53,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 03:03:53,628 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 03:03:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:53,629 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 03:03:53,629 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 03:03:53,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:53,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:53,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:53,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 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-28 03:03:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-28 03:03:53,630 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2022-04-28 03:03:53,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:53,630 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-28 03:03:53,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 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-28 03:03:53,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-28 03:03:53,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 03:03:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 03:03:53,682 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:53,682 INFO L195 NwaCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:53,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:53,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:53,883 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:53,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:53,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1988072778, now seen corresponding path program 109 times [2022-04-28 03:03:53,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:53,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1884618587] [2022-04-28 03:03:55,877 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:03:56,000 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:03:56,001 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1324380791, now seen corresponding path program 1 times [2022-04-28 03:03:56,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:56,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761293281] [2022-04-28 03:03:56,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:56,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:56,007 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:56,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1988072778, now seen corresponding path program 110 times [2022-04-28 03:03:56,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:56,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159368297] [2022-04-28 03:03:56,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:56,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:57,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:57,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {32911#(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(12, 2);call #Ultimate.allocInit(12, 3); {32850#true} is VALID [2022-04-28 03:03:57,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {32850#true} assume true; {32850#true} is VALID [2022-04-28 03:03:57,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32850#true} {32850#true} #34#return; {32850#true} is VALID [2022-04-28 03:03:57,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {32850#true} call ULTIMATE.init(); {32911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:57,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {32911#(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(12, 2);call #Ultimate.allocInit(12, 3); {32850#true} is VALID [2022-04-28 03:03:57,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {32850#true} assume true; {32850#true} is VALID [2022-04-28 03:03:57,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32850#true} {32850#true} #34#return; {32850#true} is VALID [2022-04-28 03:03:57,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {32850#true} call #t~ret5 := main(); {32850#true} is VALID [2022-04-28 03:03:57,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {32850#true} ~x~0 := 1;~y~0 := 0; {32855#(= main_~y~0 0)} is VALID [2022-04-28 03:03:57,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {32855#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:03:57,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {32856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:03:57,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {32857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:03:57,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {32858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:03:57,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {32859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:03:57,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {32860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32861#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:03:57,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {32861#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32862#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:03:57,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {32862#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32863#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:03:57,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {32863#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32864#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:03:57,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {32864#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32865#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:03:57,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {32865#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:03:57,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {32866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32867#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:03:57,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {32867#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32868#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:03:57,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {32868#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32869#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:03:57,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {32869#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32870#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:03:57,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {32870#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32871#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:03:57,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {32871#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32872#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:03:57,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {32872#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32873#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:03:57,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {32873#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32874#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:03:57,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {32874#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32875#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:03:57,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {32875#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32876#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:03:57,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {32876#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32877#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:03:57,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {32877#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32878#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:03:57,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {32878#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32879#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:03:57,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {32879#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32880#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:03:57,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {32880#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32881#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:03:57,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {32881#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32882#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:03:57,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {32882#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32883#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:03:57,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {32883#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32884#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:03:57,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {32884#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32885#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:03:57,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {32885#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32886#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:03:57,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {32886#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32887#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:03:57,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {32887#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32888#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:03:57,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {32888#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32889#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:03:57,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {32889#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32890#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:03:57,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {32890#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32891#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:03:57,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {32891#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32892#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:03:57,490 INFO L290 TraceCheckUtils]: 43: Hoare triple {32892#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32893#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:03:57,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {32893#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32894#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:03:57,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {32894#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32895#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:03:57,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {32895#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32896#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:03:57,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {32896#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32897#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:03:57,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {32897#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32898#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:03:57,493 INFO L290 TraceCheckUtils]: 49: Hoare triple {32898#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32899#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:03:57,493 INFO L290 TraceCheckUtils]: 50: Hoare triple {32899#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32900#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:03:57,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {32900#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32901#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:03:57,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {32901#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32902#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:03:57,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {32902#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32903#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:03:57,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {32903#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32904#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:03:57,496 INFO L290 TraceCheckUtils]: 55: Hoare triple {32904#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32905#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:03:57,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {32905#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32906#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:03:57,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {32906#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32907#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:03:57,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {32907#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32908#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:03:57,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {32908#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32909#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:03:57,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {32909#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32910#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 55))} is VALID [2022-04-28 03:03:57,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {32910#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 55))} assume !(~y~0 % 4294967296 < 1024); {32851#false} is VALID [2022-04-28 03:03:57,499 INFO L272 TraceCheckUtils]: 62: Hoare triple {32851#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {32851#false} is VALID [2022-04-28 03:03:57,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {32851#false} ~cond := #in~cond; {32851#false} is VALID [2022-04-28 03:03:57,499 INFO L290 TraceCheckUtils]: 64: Hoare triple {32851#false} assume 0 == ~cond; {32851#false} is VALID [2022-04-28 03:03:57,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {32851#false} assume !false; {32851#false} is VALID [2022-04-28 03:03:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:57,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:57,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159368297] [2022-04-28 03:03:57,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159368297] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:57,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786007271] [2022-04-28 03:03:57,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:03:57,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:57,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:57,501 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:57,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-28 03:03:57,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:03:57,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:57,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 113 conjunts are in the unsatisfiable core [2022-04-28 03:03:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:57,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:58,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {32850#true} call ULTIMATE.init(); {32850#true} is VALID [2022-04-28 03:03:58,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {32850#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(12, 2);call #Ultimate.allocInit(12, 3); {32850#true} is VALID [2022-04-28 03:03:58,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {32850#true} assume true; {32850#true} is VALID [2022-04-28 03:03:58,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32850#true} {32850#true} #34#return; {32850#true} is VALID [2022-04-28 03:03:58,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {32850#true} call #t~ret5 := main(); {32850#true} is VALID [2022-04-28 03:03:58,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {32850#true} ~x~0 := 1;~y~0 := 0; {32855#(= main_~y~0 0)} is VALID [2022-04-28 03:03:58,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {32855#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:03:58,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {32856#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:03:58,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {32857#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:03:58,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {32858#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:03:58,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {32859#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:03:58,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {32860#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32861#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:03:58,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {32861#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32862#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:03:58,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {32862#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32863#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:03:58,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {32863#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32864#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:03:58,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {32864#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32865#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:03:58,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {32865#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:03:58,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {32866#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32867#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:03:58,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {32867#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32868#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:03:58,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {32868#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32869#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:03:58,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {32869#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32870#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:03:58,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {32870#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32871#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:03:58,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {32871#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32872#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:03:58,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {32872#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32873#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:03:58,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {32873#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32874#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:03:58,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {32874#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32875#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:03:58,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {32875#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32876#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:03:58,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {32876#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32877#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:03:58,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {32877#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32878#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:03:58,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {32878#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32879#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:03:58,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {32879#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32880#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:03:58,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {32880#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32881#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:03:58,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {32881#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32882#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:03:58,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {32882#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32883#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:03:58,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {32883#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32884#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:03:58,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {32884#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32885#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:03:58,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {32885#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32886#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:03:58,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {32886#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32887#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:03:58,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {32887#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32888#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:03:58,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {32888#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32889#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:03:58,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {32889#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32890#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:03:58,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {32890#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32891#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:03:58,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {32891#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32892#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:03:58,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {32892#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32893#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:03:58,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {32893#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32894#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:03:58,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {32894#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32895#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:03:58,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {32895#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32896#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:03:58,206 INFO L290 TraceCheckUtils]: 47: Hoare triple {32896#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32897#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:03:58,207 INFO L290 TraceCheckUtils]: 48: Hoare triple {32897#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32898#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:03:58,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {32898#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32899#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:03:58,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {32899#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32900#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:03:58,208 INFO L290 TraceCheckUtils]: 51: Hoare triple {32900#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32901#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:03:58,209 INFO L290 TraceCheckUtils]: 52: Hoare triple {32901#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32902#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:03:58,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {32902#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32903#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:03:58,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {32903#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32904#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:03:58,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {32904#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32905#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:03:58,211 INFO L290 TraceCheckUtils]: 56: Hoare triple {32905#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32906#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:03:58,211 INFO L290 TraceCheckUtils]: 57: Hoare triple {32906#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32907#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:03:58,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {32907#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32908#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:03:58,212 INFO L290 TraceCheckUtils]: 59: Hoare triple {32908#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {32909#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:03:58,212 INFO L290 TraceCheckUtils]: 60: Hoare triple {32909#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33095#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:03:58,213 INFO L290 TraceCheckUtils]: 61: Hoare triple {33095#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !(~y~0 % 4294967296 < 1024); {32851#false} is VALID [2022-04-28 03:03:58,213 INFO L272 TraceCheckUtils]: 62: Hoare triple {32851#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {32851#false} is VALID [2022-04-28 03:03:58,213 INFO L290 TraceCheckUtils]: 63: Hoare triple {32851#false} ~cond := #in~cond; {32851#false} is VALID [2022-04-28 03:03:58,213 INFO L290 TraceCheckUtils]: 64: Hoare triple {32851#false} assume 0 == ~cond; {32851#false} is VALID [2022-04-28 03:03:58,213 INFO L290 TraceCheckUtils]: 65: Hoare triple {32851#false} assume !false; {32851#false} is VALID [2022-04-28 03:03:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:58,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:02,766 INFO L290 TraceCheckUtils]: 65: Hoare triple {32851#false} assume !false; {32851#false} is VALID [2022-04-28 03:04:02,766 INFO L290 TraceCheckUtils]: 64: Hoare triple {32851#false} assume 0 == ~cond; {32851#false} is VALID [2022-04-28 03:04:02,766 INFO L290 TraceCheckUtils]: 63: Hoare triple {32851#false} ~cond := #in~cond; {32851#false} is VALID [2022-04-28 03:04:02,766 INFO L272 TraceCheckUtils]: 62: Hoare triple {32851#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {32851#false} is VALID [2022-04-28 03:04:02,766 INFO L290 TraceCheckUtils]: 61: Hoare triple {33123#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {32851#false} is VALID [2022-04-28 03:04:02,767 INFO L290 TraceCheckUtils]: 60: Hoare triple {33127#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33123#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:04:02,768 INFO L290 TraceCheckUtils]: 59: Hoare triple {33131#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33127#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {33135#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33131#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {33139#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33135#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {33143#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33139#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,770 INFO L290 TraceCheckUtils]: 55: Hoare triple {33147#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33143#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,771 INFO L290 TraceCheckUtils]: 54: Hoare triple {33151#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33147#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {33155#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33151#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {33159#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33155#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {33163#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33159#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {33167#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33163#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {33171#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33167#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,776 INFO L290 TraceCheckUtils]: 48: Hoare triple {33175#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33171#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,778 INFO L290 TraceCheckUtils]: 47: Hoare triple {33179#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33175#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {33183#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33179#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,779 INFO L290 TraceCheckUtils]: 45: Hoare triple {33187#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33183#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {33191#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33187#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {33195#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33191#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {33199#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33195#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {33203#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33199#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {33207#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33203#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {33211#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33207#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {33215#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33211#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {33219#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33215#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {33223#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33219#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {33227#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33223#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {33231#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33227#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {33235#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33231#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {33239#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33235#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {33243#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33239#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {33247#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33243#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {33251#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33247#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {33255#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33251#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {33259#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33255#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {33263#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33259#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {33267#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33263#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {33271#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33267#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {33275#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33271#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {33279#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33275#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {33283#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33279#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {33287#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33283#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {33291#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33287#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {33295#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33291#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {33299#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33295#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {33303#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33299#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {33307#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33303#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {33311#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33307#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {33315#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33311#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {33319#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33315#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {33323#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33319#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {33327#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33323#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {33331#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33327#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {33335#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33331#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {33339#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33335#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {33343#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33339#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {32850#true} ~x~0 := 1;~y~0 := 0; {33343#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:04:02,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {32850#true} call #t~ret5 := main(); {32850#true} is VALID [2022-04-28 03:04:02,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32850#true} {32850#true} #34#return; {32850#true} is VALID [2022-04-28 03:04:02,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {32850#true} assume true; {32850#true} is VALID [2022-04-28 03:04:02,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {32850#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(12, 2);call #Ultimate.allocInit(12, 3); {32850#true} is VALID [2022-04-28 03:04:02,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {32850#true} call ULTIMATE.init(); {32850#true} is VALID [2022-04-28 03:04:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:02,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786007271] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:02,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:02,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 116 [2022-04-28 03:04:02,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:02,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1884618587] [2022-04-28 03:04:02,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1884618587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:02,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:02,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-28 03:04:02,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852544202] [2022-04-28 03:04:02,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:02,821 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 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 66 [2022-04-28 03:04:02,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:02,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 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-28 03:04:02,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:02,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-28 03:04:02,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:02,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-28 03:04:02,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3477, Invalid=9863, Unknown=0, NotChecked=0, Total=13340 [2022-04-28 03:04:02,854 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 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-28 03:04:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:08,744 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-28 03:04:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-28 03:04:08,745 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 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 66 [2022-04-28 03:04:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 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-28 03:04:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-28 03:04:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 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-28 03:04:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-28 03:04:08,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 73 transitions. [2022-04-28 03:04:08,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:08,788 INFO L225 Difference]: With dead ends: 73 [2022-04-28 03:04:08,788 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 03:04:08,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=6947, Invalid=22465, Unknown=0, NotChecked=0, Total=29412 [2022-04-28 03:04:08,791 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 3197 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:08,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 128 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3197 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 03:04:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 03:04:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 03:04:08,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:08,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:08,856 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:08,856 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:08,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:08,857 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 03:04:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 03:04:08,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:08,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:08,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 03:04:08,857 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 03:04:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:08,857 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 03:04:08,858 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 03:04:08,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:08,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:08,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:08,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2022-04-28 03:04:08,858 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2022-04-28 03:04:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:08,859 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2022-04-28 03:04:08,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 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-28 03:04:08,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 68 transitions. [2022-04-28 03:04:08,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 03:04:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 03:04:08,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:08,913 INFO L195 NwaCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:08,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-28 03:04:09,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,SelfDestructingSolverStorable111,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:09,119 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:09,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:09,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1464252708, now seen corresponding path program 111 times [2022-04-28 03:04:09,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:09,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1177428149] [2022-04-28 03:04:10,975 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:04:11,122 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:04:11,123 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1383486135, now seen corresponding path program 1 times [2022-04-28 03:04:11,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:11,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025217281] [2022-04-28 03:04:11,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:11,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:11,128 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:11,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1464252708, now seen corresponding path program 112 times [2022-04-28 03:04:11,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:11,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776427732] [2022-04-28 03:04:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:11,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:12,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:12,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {33956#(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(12, 2);call #Ultimate.allocInit(12, 3); {33894#true} is VALID [2022-04-28 03:04:12,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {33894#true} assume true; {33894#true} is VALID [2022-04-28 03:04:12,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33894#true} {33894#true} #34#return; {33894#true} is VALID [2022-04-28 03:04:12,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {33894#true} call ULTIMATE.init(); {33956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:04:12,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {33956#(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(12, 2);call #Ultimate.allocInit(12, 3); {33894#true} is VALID [2022-04-28 03:04:12,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {33894#true} assume true; {33894#true} is VALID [2022-04-28 03:04:12,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33894#true} {33894#true} #34#return; {33894#true} is VALID [2022-04-28 03:04:12,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {33894#true} call #t~ret5 := main(); {33894#true} is VALID [2022-04-28 03:04:12,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {33894#true} ~x~0 := 1;~y~0 := 0; {33899#(= main_~y~0 0)} is VALID [2022-04-28 03:04:12,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {33899#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33900#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:04:12,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {33900#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33901#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:04:12,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {33901#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33902#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:04:12,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {33902#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33903#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:04:12,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {33903#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33904#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:04:12,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {33904#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33905#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:04:12,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {33905#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33906#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:04:12,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {33906#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33907#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:04:12,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {33907#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33908#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:04:12,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {33908#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33909#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:04:12,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {33909#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33910#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:04:12,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {33910#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33911#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:04:12,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {33911#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33912#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:04:12,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {33912#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33913#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:04:12,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {33913#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33914#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:04:12,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {33914#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33915#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:04:12,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {33915#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33916#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:04:12,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {33916#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33917#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:04:12,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {33917#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33918#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:04:12,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {33918#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33919#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:04:12,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {33919#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33920#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:04:12,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {33920#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33921#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:04:12,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {33921#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33922#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:04:12,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {33922#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33923#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:04:12,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {33923#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33924#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:04:12,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {33924#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33925#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:04:12,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {33925#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33926#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:04:12,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {33926#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33927#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:04:12,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {33927#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33928#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:04:12,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {33928#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33929#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:04:12,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {33929#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33930#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:04:12,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {33930#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33931#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:04:12,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {33931#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33932#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:04:12,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {33932#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33933#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:04:12,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {33933#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33934#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:04:12,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {33934#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33935#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:04:12,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {33935#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33936#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:04:12,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {33936#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33937#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:04:12,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {33937#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33938#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:04:12,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {33938#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33939#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:04:12,771 INFO L290 TraceCheckUtils]: 46: Hoare triple {33939#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33940#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:04:12,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {33940#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33941#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:04:12,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {33941#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33942#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:04:12,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {33942#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33943#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:04:12,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {33943#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33944#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:04:12,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {33944#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33945#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:04:12,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {33945#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33946#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:04:12,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {33946#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33947#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:04:12,775 INFO L290 TraceCheckUtils]: 54: Hoare triple {33947#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33948#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:04:12,775 INFO L290 TraceCheckUtils]: 55: Hoare triple {33948#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33949#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:04:12,776 INFO L290 TraceCheckUtils]: 56: Hoare triple {33949#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33950#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:04:12,776 INFO L290 TraceCheckUtils]: 57: Hoare triple {33950#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33951#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:04:12,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {33951#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33952#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:04:12,777 INFO L290 TraceCheckUtils]: 59: Hoare triple {33952#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33953#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:04:12,778 INFO L290 TraceCheckUtils]: 60: Hoare triple {33953#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33954#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:04:12,778 INFO L290 TraceCheckUtils]: 61: Hoare triple {33954#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33955#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 56))} is VALID [2022-04-28 03:04:12,779 INFO L290 TraceCheckUtils]: 62: Hoare triple {33955#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 56))} assume !(~y~0 % 4294967296 < 1024); {33895#false} is VALID [2022-04-28 03:04:12,779 INFO L272 TraceCheckUtils]: 63: Hoare triple {33895#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {33895#false} is VALID [2022-04-28 03:04:12,779 INFO L290 TraceCheckUtils]: 64: Hoare triple {33895#false} ~cond := #in~cond; {33895#false} is VALID [2022-04-28 03:04:12,779 INFO L290 TraceCheckUtils]: 65: Hoare triple {33895#false} assume 0 == ~cond; {33895#false} is VALID [2022-04-28 03:04:12,779 INFO L290 TraceCheckUtils]: 66: Hoare triple {33895#false} assume !false; {33895#false} is VALID [2022-04-28 03:04:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:12,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:12,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776427732] [2022-04-28 03:04:12,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776427732] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:12,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369213835] [2022-04-28 03:04:12,780 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:04:12,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:12,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:12,781 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:04:12,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-28 03:04:12,859 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:04:12,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:12,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 115 conjunts are in the unsatisfiable core [2022-04-28 03:04:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:12,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:13,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {33894#true} call ULTIMATE.init(); {33894#true} is VALID [2022-04-28 03:04:13,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {33894#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(12, 2);call #Ultimate.allocInit(12, 3); {33894#true} is VALID [2022-04-28 03:04:13,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {33894#true} assume true; {33894#true} is VALID [2022-04-28 03:04:13,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33894#true} {33894#true} #34#return; {33894#true} is VALID [2022-04-28 03:04:13,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {33894#true} call #t~ret5 := main(); {33894#true} is VALID [2022-04-28 03:04:13,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {33894#true} ~x~0 := 1;~y~0 := 0; {33899#(= main_~y~0 0)} is VALID [2022-04-28 03:04:13,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {33899#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33900#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:04:13,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {33900#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33901#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:04:13,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {33901#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33902#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:04:13,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {33902#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33903#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:04:13,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {33903#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33904#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:04:13,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {33904#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33905#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:04:13,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {33905#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33906#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:04:13,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {33906#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33907#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:04:13,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {33907#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33908#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:04:13,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {33908#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33909#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:04:13,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {33909#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33910#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:04:13,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {33910#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33911#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:04:13,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {33911#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33912#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:04:13,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {33912#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33913#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:04:13,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {33913#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33914#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:04:13,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {33914#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33915#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:04:13,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {33915#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33916#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:04:13,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {33916#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33917#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:04:13,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {33917#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33918#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:04:13,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {33918#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33919#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:04:13,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {33919#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33920#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:04:13,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {33920#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33921#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:04:13,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {33921#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33922#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:04:13,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {33922#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33923#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:04:13,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {33923#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33924#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:04:13,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {33924#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33925#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:04:13,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {33925#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33926#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:04:13,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {33926#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33927#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:04:13,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {33927#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33928#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:04:13,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {33928#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33929#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:04:13,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {33929#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33930#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:04:13,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {33930#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33931#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:04:13,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {33931#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33932#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:04:13,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {33932#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33933#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:04:13,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {33933#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33934#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:04:13,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {33934#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33935#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:04:13,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {33935#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33936#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:04:13,486 INFO L290 TraceCheckUtils]: 43: Hoare triple {33936#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33937#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:04:13,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {33937#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33938#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:04:13,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {33938#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33939#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:04:13,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {33939#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33940#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:04:13,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {33940#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33941#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:04:13,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {33941#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33942#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:04:13,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {33942#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33943#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:04:13,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {33943#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33944#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:04:13,489 INFO L290 TraceCheckUtils]: 51: Hoare triple {33944#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33945#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:04:13,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {33945#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33946#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:04:13,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {33946#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33947#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:04:13,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {33947#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33948#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:04:13,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {33948#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33949#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:04:13,492 INFO L290 TraceCheckUtils]: 56: Hoare triple {33949#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33950#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:04:13,492 INFO L290 TraceCheckUtils]: 57: Hoare triple {33950#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33951#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:04:13,493 INFO L290 TraceCheckUtils]: 58: Hoare triple {33951#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33952#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:04:13,493 INFO L290 TraceCheckUtils]: 59: Hoare triple {33952#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33953#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:04:13,494 INFO L290 TraceCheckUtils]: 60: Hoare triple {33953#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {33954#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:04:13,494 INFO L290 TraceCheckUtils]: 61: Hoare triple {33954#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34143#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:04:13,494 INFO L290 TraceCheckUtils]: 62: Hoare triple {34143#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {33895#false} is VALID [2022-04-28 03:04:13,495 INFO L272 TraceCheckUtils]: 63: Hoare triple {33895#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {33895#false} is VALID [2022-04-28 03:04:13,495 INFO L290 TraceCheckUtils]: 64: Hoare triple {33895#false} ~cond := #in~cond; {33895#false} is VALID [2022-04-28 03:04:13,495 INFO L290 TraceCheckUtils]: 65: Hoare triple {33895#false} assume 0 == ~cond; {33895#false} is VALID [2022-04-28 03:04:13,495 INFO L290 TraceCheckUtils]: 66: Hoare triple {33895#false} assume !false; {33895#false} is VALID [2022-04-28 03:04:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:13,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:18,184 INFO L290 TraceCheckUtils]: 66: Hoare triple {33895#false} assume !false; {33895#false} is VALID [2022-04-28 03:04:18,185 INFO L290 TraceCheckUtils]: 65: Hoare triple {33895#false} assume 0 == ~cond; {33895#false} is VALID [2022-04-28 03:04:18,185 INFO L290 TraceCheckUtils]: 64: Hoare triple {33895#false} ~cond := #in~cond; {33895#false} is VALID [2022-04-28 03:04:18,185 INFO L272 TraceCheckUtils]: 63: Hoare triple {33895#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {33895#false} is VALID [2022-04-28 03:04:18,185 INFO L290 TraceCheckUtils]: 62: Hoare triple {34171#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {33895#false} is VALID [2022-04-28 03:04:18,186 INFO L290 TraceCheckUtils]: 61: Hoare triple {34175#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34171#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:04:18,186 INFO L290 TraceCheckUtils]: 60: Hoare triple {34179#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34175#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,187 INFO L290 TraceCheckUtils]: 59: Hoare triple {34183#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34179#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,188 INFO L290 TraceCheckUtils]: 58: Hoare triple {34187#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34183#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,188 INFO L290 TraceCheckUtils]: 57: Hoare triple {34191#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34187#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,189 INFO L290 TraceCheckUtils]: 56: Hoare triple {34195#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34191#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,192 INFO L290 TraceCheckUtils]: 55: Hoare triple {34199#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34195#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {34203#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34199#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {34207#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34203#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {34211#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34207#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,194 INFO L290 TraceCheckUtils]: 51: Hoare triple {34215#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34211#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,195 INFO L290 TraceCheckUtils]: 50: Hoare triple {34219#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34215#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {34223#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34219#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {34227#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34223#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,197 INFO L290 TraceCheckUtils]: 47: Hoare triple {34231#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34227#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,197 INFO L290 TraceCheckUtils]: 46: Hoare triple {34235#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34231#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {34239#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34235#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {34243#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34239#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {34247#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34243#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {34251#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34247#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {34255#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34251#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {34259#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34255#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {34263#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34259#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {34267#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34263#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {34271#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34267#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {34275#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34271#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {34279#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34275#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {34283#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34279#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {34287#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34283#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {34291#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34287#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {34295#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34291#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {34299#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34295#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {34303#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34299#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {34307#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34303#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {34311#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34307#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {34315#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34311#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {34319#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34315#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {34323#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34319#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {34327#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34323#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {34331#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34327#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {34335#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34331#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {34339#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34335#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {34343#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34339#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {34347#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34343#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {34351#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34347#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {34355#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34351#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {34359#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34355#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {34363#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34359#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {34367#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34363#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {34371#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34367#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {34375#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34371#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {34379#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34375#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {34383#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34379#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {34387#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34383#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {34391#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34387#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {34395#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34391#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {33894#true} ~x~0 := 1;~y~0 := 0; {34395#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:18,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {33894#true} call #t~ret5 := main(); {33894#true} is VALID [2022-04-28 03:04:18,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33894#true} {33894#true} #34#return; {33894#true} is VALID [2022-04-28 03:04:18,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {33894#true} assume true; {33894#true} is VALID [2022-04-28 03:04:18,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {33894#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(12, 2);call #Ultimate.allocInit(12, 3); {33894#true} is VALID [2022-04-28 03:04:18,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {33894#true} call ULTIMATE.init(); {33894#true} is VALID [2022-04-28 03:04:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:18,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369213835] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:18,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:18,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 118 [2022-04-28 03:04:18,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:18,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1177428149] [2022-04-28 03:04:18,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1177428149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:18,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:18,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-28 03:04:18,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146868920] [2022-04-28 03:04:18,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:18,224 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 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 67 [2022-04-28 03:04:18,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:18,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 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-28 03:04:18,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:18,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-28 03:04:18,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-28 03:04:18,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=10210, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 03:04:18,258 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 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-28 03:04:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:24,378 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 03:04:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-28 03:04:24,379 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 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 67 [2022-04-28 03:04:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 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-28 03:04:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-28 03:04:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 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-28 03:04:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-28 03:04:24,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-28 03:04:24,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:24,439 INFO L225 Difference]: With dead ends: 74 [2022-04-28 03:04:24,440 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 03:04:24,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1714 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=7185, Invalid=23265, Unknown=0, NotChecked=0, Total=30450 [2022-04-28 03:04:24,441 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3334 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 3449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:24,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 3449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3334 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 03:04:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 03:04:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-28 03:04:24,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:24,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 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-28 03:04:24,508 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 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-28 03:04:24,508 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 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-28 03:04:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:24,509 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 03:04:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 03:04:24,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:24,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:24,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 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 69 states. [2022-04-28 03:04:24,509 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 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 69 states. [2022-04-28 03:04:24,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:24,510 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 03:04:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 03:04:24,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:24,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:24,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:24,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 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-28 03:04:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-04-28 03:04:24,511 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2022-04-28 03:04:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:24,511 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-04-28 03:04:24,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 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-28 03:04:24,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 69 transitions. [2022-04-28 03:04:24,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 03:04:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 03:04:24,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:24,562 INFO L195 NwaCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:24,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-28 03:04:24,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113 [2022-04-28 03:04:24,762 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:24,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:24,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1889267574, now seen corresponding path program 113 times [2022-04-28 03:04:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:24,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1420268823] [2022-04-28 03:04:25,121 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:04:25,122 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1442591479, now seen corresponding path program 1 times [2022-04-28 03:04:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:25,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407894700] [2022-04-28 03:04:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:25,128 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:25,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1889267574, now seen corresponding path program 114 times [2022-04-28 03:04:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:25,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164254221] [2022-04-28 03:04:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:26,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:26,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {35017#(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(12, 2);call #Ultimate.allocInit(12, 3); {34954#true} is VALID [2022-04-28 03:04:26,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {34954#true} assume true; {34954#true} is VALID [2022-04-28 03:04:26,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34954#true} {34954#true} #34#return; {34954#true} is VALID [2022-04-28 03:04:26,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {34954#true} call ULTIMATE.init(); {35017#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:04:26,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {35017#(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(12, 2);call #Ultimate.allocInit(12, 3); {34954#true} is VALID [2022-04-28 03:04:26,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {34954#true} assume true; {34954#true} is VALID [2022-04-28 03:04:26,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34954#true} {34954#true} #34#return; {34954#true} is VALID [2022-04-28 03:04:26,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {34954#true} call #t~ret5 := main(); {34954#true} is VALID [2022-04-28 03:04:26,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {34954#true} ~x~0 := 1;~y~0 := 0; {34959#(= main_~y~0 0)} is VALID [2022-04-28 03:04:26,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {34959#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34960#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:04:26,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {34960#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34961#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:04:26,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {34961#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34962#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:04:26,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {34962#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34963#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:04:26,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {34963#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34964#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:04:26,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {34964#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34965#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:04:26,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {34965#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34966#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:04:26,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {34966#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34967#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:04:26,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {34967#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34968#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:04:26,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {34968#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34969#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:04:26,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {34969#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34970#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:04:26,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {34970#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34971#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:04:26,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {34971#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34972#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:04:26,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {34972#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34973#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:04:26,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {34973#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34974#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:04:26,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {34974#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34975#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:04:26,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {34975#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34976#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:04:26,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {34976#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34977#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:04:26,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {34977#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34978#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:04:26,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {34978#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34979#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:04:26,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {34979#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34980#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:04:26,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {34980#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34981#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:04:26,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {34981#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34982#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:04:26,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {34982#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34983#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:04:26,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {34983#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34984#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:04:26,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {34984#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34985#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:04:26,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {34985#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34986#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:04:26,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {34986#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34987#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:04:26,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {34987#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34988#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:04:26,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {34988#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34989#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:04:26,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {34989#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34990#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:04:26,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {34990#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34991#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:04:26,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {34991#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34992#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:04:26,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {34992#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34993#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:04:26,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {34993#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34994#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:04:26,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {34994#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34995#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:04:26,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {34995#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34996#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:04:26,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {34996#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34997#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:04:26,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {34997#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34998#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:04:26,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {34998#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34999#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:04:26,700 INFO L290 TraceCheckUtils]: 46: Hoare triple {34999#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35000#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:04:26,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {35000#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35001#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:04:26,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {35001#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35002#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:04:26,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {35002#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35003#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:04:26,702 INFO L290 TraceCheckUtils]: 50: Hoare triple {35003#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35004#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:04:26,702 INFO L290 TraceCheckUtils]: 51: Hoare triple {35004#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35005#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:04:26,703 INFO L290 TraceCheckUtils]: 52: Hoare triple {35005#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35006#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:04:26,703 INFO L290 TraceCheckUtils]: 53: Hoare triple {35006#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35007#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:04:26,704 INFO L290 TraceCheckUtils]: 54: Hoare triple {35007#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35008#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:04:26,704 INFO L290 TraceCheckUtils]: 55: Hoare triple {35008#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35009#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:04:26,705 INFO L290 TraceCheckUtils]: 56: Hoare triple {35009#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35010#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:04:26,705 INFO L290 TraceCheckUtils]: 57: Hoare triple {35010#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35011#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:04:26,706 INFO L290 TraceCheckUtils]: 58: Hoare triple {35011#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35012#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:04:26,706 INFO L290 TraceCheckUtils]: 59: Hoare triple {35012#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35013#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:04:26,707 INFO L290 TraceCheckUtils]: 60: Hoare triple {35013#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35014#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:04:26,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {35014#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35015#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:04:26,708 INFO L290 TraceCheckUtils]: 62: Hoare triple {35015#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35016#(and (<= main_~y~0 57) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:04:26,708 INFO L290 TraceCheckUtils]: 63: Hoare triple {35016#(and (<= main_~y~0 57) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {34955#false} is VALID [2022-04-28 03:04:26,708 INFO L272 TraceCheckUtils]: 64: Hoare triple {34955#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {34955#false} is VALID [2022-04-28 03:04:26,708 INFO L290 TraceCheckUtils]: 65: Hoare triple {34955#false} ~cond := #in~cond; {34955#false} is VALID [2022-04-28 03:04:26,708 INFO L290 TraceCheckUtils]: 66: Hoare triple {34955#false} assume 0 == ~cond; {34955#false} is VALID [2022-04-28 03:04:26,708 INFO L290 TraceCheckUtils]: 67: Hoare triple {34955#false} assume !false; {34955#false} is VALID [2022-04-28 03:04:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:26,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:26,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164254221] [2022-04-28 03:04:26,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164254221] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:26,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158594667] [2022-04-28 03:04:26,709 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:04:26,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:26,710 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:04:26,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-28 03:04:37,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2022-04-28 03:04:37,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:37,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 117 conjunts are in the unsatisfiable core [2022-04-28 03:04:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:37,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:37,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {34954#true} call ULTIMATE.init(); {34954#true} is VALID [2022-04-28 03:04:37,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {34954#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(12, 2);call #Ultimate.allocInit(12, 3); {34954#true} is VALID [2022-04-28 03:04:37,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {34954#true} assume true; {34954#true} is VALID [2022-04-28 03:04:37,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34954#true} {34954#true} #34#return; {34954#true} is VALID [2022-04-28 03:04:37,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {34954#true} call #t~ret5 := main(); {34954#true} is VALID [2022-04-28 03:04:37,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {34954#true} ~x~0 := 1;~y~0 := 0; {34959#(= main_~y~0 0)} is VALID [2022-04-28 03:04:37,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {34959#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34960#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:04:37,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {34960#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34961#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:04:37,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {34961#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34962#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:04:37,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {34962#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34963#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:04:37,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {34963#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34964#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:04:37,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {34964#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34965#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:04:37,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {34965#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34966#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:04:37,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {34966#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34967#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:04:37,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {34967#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34968#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:04:37,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {34968#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34969#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:04:37,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {34969#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34970#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:04:37,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {34970#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34971#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:04:37,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {34971#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34972#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:04:37,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {34972#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34973#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:04:37,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {34973#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34974#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:04:37,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {34974#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34975#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:04:37,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {34975#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34976#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:04:37,942 INFO L290 TraceCheckUtils]: 23: Hoare triple {34976#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34977#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:04:37,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {34977#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34978#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:04:37,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {34978#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34979#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:04:37,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {34979#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34980#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:04:37,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {34980#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34981#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:04:37,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {34981#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34982#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:04:37,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {34982#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34983#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:04:37,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {34983#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34984#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:04:37,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {34984#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34985#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:04:37,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {34985#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34986#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:04:37,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {34986#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34987#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:04:37,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {34987#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34988#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:04:37,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {34988#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34989#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:04:37,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {34989#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34990#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:04:37,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {34990#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34991#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:04:37,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {34991#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34992#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:04:37,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {34992#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34993#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:04:37,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {34993#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34994#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:04:37,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {34994#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34995#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:04:37,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {34995#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34996#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:04:37,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {34996#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34997#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:04:37,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {34997#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34998#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:04:37,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {34998#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {34999#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:04:37,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {34999#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35000#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:04:37,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {35000#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35001#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:04:37,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {35001#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35002#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:04:37,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {35002#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35003#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:04:37,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {35003#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35004#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:04:37,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {35004#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35005#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:04:37,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {35005#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35006#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:04:37,958 INFO L290 TraceCheckUtils]: 53: Hoare triple {35006#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35007#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:04:37,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {35007#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35008#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:04:37,959 INFO L290 TraceCheckUtils]: 55: Hoare triple {35008#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35009#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:04:37,959 INFO L290 TraceCheckUtils]: 56: Hoare triple {35009#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35010#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:04:37,960 INFO L290 TraceCheckUtils]: 57: Hoare triple {35010#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35011#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:04:37,960 INFO L290 TraceCheckUtils]: 58: Hoare triple {35011#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35012#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:04:37,961 INFO L290 TraceCheckUtils]: 59: Hoare triple {35012#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35013#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:04:37,961 INFO L290 TraceCheckUtils]: 60: Hoare triple {35013#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35014#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:04:37,962 INFO L290 TraceCheckUtils]: 61: Hoare triple {35014#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35015#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:04:37,962 INFO L290 TraceCheckUtils]: 62: Hoare triple {35015#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35207#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:04:37,963 INFO L290 TraceCheckUtils]: 63: Hoare triple {35207#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {34955#false} is VALID [2022-04-28 03:04:37,963 INFO L272 TraceCheckUtils]: 64: Hoare triple {34955#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {34955#false} is VALID [2022-04-28 03:04:37,963 INFO L290 TraceCheckUtils]: 65: Hoare triple {34955#false} ~cond := #in~cond; {34955#false} is VALID [2022-04-28 03:04:37,963 INFO L290 TraceCheckUtils]: 66: Hoare triple {34955#false} assume 0 == ~cond; {34955#false} is VALID [2022-04-28 03:04:37,963 INFO L290 TraceCheckUtils]: 67: Hoare triple {34955#false} assume !false; {34955#false} is VALID [2022-04-28 03:04:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:37,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:42,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {34955#false} assume !false; {34955#false} is VALID [2022-04-28 03:04:42,840 INFO L290 TraceCheckUtils]: 66: Hoare triple {34955#false} assume 0 == ~cond; {34955#false} is VALID [2022-04-28 03:04:42,840 INFO L290 TraceCheckUtils]: 65: Hoare triple {34955#false} ~cond := #in~cond; {34955#false} is VALID [2022-04-28 03:04:42,840 INFO L272 TraceCheckUtils]: 64: Hoare triple {34955#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {34955#false} is VALID [2022-04-28 03:04:42,840 INFO L290 TraceCheckUtils]: 63: Hoare triple {35235#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {34955#false} is VALID [2022-04-28 03:04:42,841 INFO L290 TraceCheckUtils]: 62: Hoare triple {35239#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35235#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:04:42,842 INFO L290 TraceCheckUtils]: 61: Hoare triple {35243#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35239#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,843 INFO L290 TraceCheckUtils]: 60: Hoare triple {35247#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35243#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,843 INFO L290 TraceCheckUtils]: 59: Hoare triple {35251#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35247#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,844 INFO L290 TraceCheckUtils]: 58: Hoare triple {35255#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35251#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,844 INFO L290 TraceCheckUtils]: 57: Hoare triple {35259#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35255#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,845 INFO L290 TraceCheckUtils]: 56: Hoare triple {35263#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35259#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,845 INFO L290 TraceCheckUtils]: 55: Hoare triple {35267#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35263#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {35271#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35267#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,847 INFO L290 TraceCheckUtils]: 53: Hoare triple {35275#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35271#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,847 INFO L290 TraceCheckUtils]: 52: Hoare triple {35279#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35275#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,848 INFO L290 TraceCheckUtils]: 51: Hoare triple {35283#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35279#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {35287#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35283#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {35291#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35287#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {35295#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35291#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,851 INFO L290 TraceCheckUtils]: 47: Hoare triple {35299#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35295#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {35303#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35299#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,852 INFO L290 TraceCheckUtils]: 45: Hoare triple {35307#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35303#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {35311#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35307#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {35315#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35311#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,855 INFO L290 TraceCheckUtils]: 42: Hoare triple {35319#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35315#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,855 INFO L290 TraceCheckUtils]: 41: Hoare triple {35323#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35319#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {35327#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35323#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {35331#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35327#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {35335#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35331#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {35339#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35335#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {35343#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35339#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {35347#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35343#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {35351#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35347#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {35355#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35351#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {35359#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35355#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {35363#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35359#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {35367#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35363#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {35371#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35367#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {35375#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35371#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {35379#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35375#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {35383#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35379#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {35387#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35383#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {35391#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35387#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {35395#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35391#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {35399#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35395#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {35403#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35399#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {35407#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35403#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {35411#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35407#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {35415#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35411#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {35419#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35415#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {35423#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35419#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {35427#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35423#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {35431#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35427#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {35435#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35431#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {35439#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35435#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {35443#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35439#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {35447#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35443#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {35451#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35447#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {35455#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35451#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {35459#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35455#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {35463#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {35459#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {34954#true} ~x~0 := 1;~y~0 := 0; {35463#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:42,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {34954#true} call #t~ret5 := main(); {34954#true} is VALID [2022-04-28 03:04:42,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34954#true} {34954#true} #34#return; {34954#true} is VALID [2022-04-28 03:04:42,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {34954#true} assume true; {34954#true} is VALID [2022-04-28 03:04:42,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {34954#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(12, 2);call #Ultimate.allocInit(12, 3); {34954#true} is VALID [2022-04-28 03:04:42,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {34954#true} call ULTIMATE.init(); {34954#true} is VALID [2022-04-28 03:04:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:42,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158594667] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:42,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:42,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 120 [2022-04-28 03:04:42,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:42,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1420268823] [2022-04-28 03:04:42,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1420268823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:42,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:42,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-28 03:04:42,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613802047] [2022-04-28 03:04:42,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:42,879 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 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 68 [2022-04-28 03:04:42,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:42,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 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-28 03:04:42,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:42,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-28 03:04:42,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:42,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-28 03:04:42,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3717, Invalid=10563, Unknown=0, NotChecked=0, Total=14280 [2022-04-28 03:04:42,922 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 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-28 03:04:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:49,264 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-28 03:04:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-28 03:04:49,265 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 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 68 [2022-04-28 03:04:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 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-28 03:04:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-04-28 03:04:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 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-28 03:04:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-04-28 03:04:49,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 75 transitions. [2022-04-28 03:04:49,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:49,310 INFO L225 Difference]: With dead ends: 75 [2022-04-28 03:04:49,310 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 03:04:49,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1773 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=7427, Invalid=24079, Unknown=0, NotChecked=0, Total=31506 [2022-04-28 03:04:49,312 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3448 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 3565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:49,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 3565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3448 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 03:04:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 03:04:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 03:04:49,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:49,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 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-28 03:04:49,382 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 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-28 03:04:49,382 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 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-28 03:04:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:49,383 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 03:04:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 03:04:49,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:49,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:49,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 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 70 states. [2022-04-28 03:04:49,383 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 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 70 states. [2022-04-28 03:04:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:49,391 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 03:04:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 03:04:49,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:49,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:49,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:49,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 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-28 03:04:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2022-04-28 03:04:49,392 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2022-04-28 03:04:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:49,393 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2022-04-28 03:04:49,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 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-28 03:04:49,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 70 transitions. [2022-04-28 03:04:49,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 03:04:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 03:04:49,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:49,443 INFO L195 NwaCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:49,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-28 03:04:49,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115,SelfDestructingSolverStorable114 [2022-04-28 03:04:49,644 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1525786084, now seen corresponding path program 115 times [2022-04-28 03:04:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:49,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [267099717] [2022-04-28 03:04:50,779 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:04:50,920 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:04:50,921 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:50,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1501696823, now seen corresponding path program 1 times [2022-04-28 03:04:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:50,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202679066] [2022-04-28 03:04:50,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:50,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:50,927 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:50,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1525786084, now seen corresponding path program 116 times [2022-04-28 03:04:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:50,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935225382] [2022-04-28 03:04:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:52,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:52,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {36094#(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(12, 2);call #Ultimate.allocInit(12, 3); {36030#true} is VALID [2022-04-28 03:04:52,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {36030#true} assume true; {36030#true} is VALID [2022-04-28 03:04:52,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36030#true} {36030#true} #34#return; {36030#true} is VALID [2022-04-28 03:04:52,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {36030#true} call ULTIMATE.init(); {36094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:04:52,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {36094#(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(12, 2);call #Ultimate.allocInit(12, 3); {36030#true} is VALID [2022-04-28 03:04:52,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {36030#true} assume true; {36030#true} is VALID [2022-04-28 03:04:52,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36030#true} {36030#true} #34#return; {36030#true} is VALID [2022-04-28 03:04:52,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {36030#true} call #t~ret5 := main(); {36030#true} is VALID [2022-04-28 03:04:52,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {36030#true} ~x~0 := 1;~y~0 := 0; {36035#(= main_~y~0 0)} is VALID [2022-04-28 03:04:52,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {36035#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36036#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:04:52,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {36036#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36037#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:04:52,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {36037#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36038#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:04:52,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {36038#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36039#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:04:52,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {36039#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36040#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:04:52,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {36040#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36041#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:04:52,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {36041#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36042#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:04:52,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {36042#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36043#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:04:52,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {36043#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36044#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:04:52,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {36044#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36045#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:04:52,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {36045#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36046#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:04:52,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {36046#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36047#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:04:52,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {36047#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36048#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:04:52,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {36048#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36049#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:04:52,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {36049#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36050#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:04:52,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {36050#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36051#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:04:52,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {36051#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36052#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:04:52,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {36052#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36053#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:04:52,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {36053#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36054#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:04:52,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {36054#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36055#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:04:52,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {36055#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36056#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:04:52,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {36056#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36057#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:04:52,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {36057#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36058#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:04:52,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {36058#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36059#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:04:52,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {36059#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36060#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:04:52,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {36060#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36061#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:04:52,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {36061#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36062#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:04:52,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {36062#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36063#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:04:52,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {36063#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36064#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:04:52,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {36064#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36065#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:04:52,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {36065#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36066#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:04:52,578 INFO L290 TraceCheckUtils]: 37: Hoare triple {36066#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36067#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:04:52,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {36067#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36068#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:04:52,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {36068#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36069#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:04:52,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {36069#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36070#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:04:52,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {36070#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36071#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:04:52,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {36071#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36072#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:04:52,580 INFO L290 TraceCheckUtils]: 43: Hoare triple {36072#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36073#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:04:52,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {36073#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36074#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:04:52,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {36074#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36075#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:04:52,582 INFO L290 TraceCheckUtils]: 46: Hoare triple {36075#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36076#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:04:52,582 INFO L290 TraceCheckUtils]: 47: Hoare triple {36076#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36077#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:04:52,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {36077#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36078#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:04:52,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {36078#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36079#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:04:52,584 INFO L290 TraceCheckUtils]: 50: Hoare triple {36079#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36080#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:04:52,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {36080#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36081#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:04:52,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {36081#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36082#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:04:52,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {36082#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36083#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:04:52,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {36083#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36084#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:04:52,586 INFO L290 TraceCheckUtils]: 55: Hoare triple {36084#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36085#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:04:52,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {36085#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36086#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:04:52,587 INFO L290 TraceCheckUtils]: 57: Hoare triple {36086#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36087#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:04:52,587 INFO L290 TraceCheckUtils]: 58: Hoare triple {36087#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36088#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:04:52,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {36088#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36089#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:04:52,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {36089#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36090#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:04:52,589 INFO L290 TraceCheckUtils]: 61: Hoare triple {36090#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36091#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:04:52,589 INFO L290 TraceCheckUtils]: 62: Hoare triple {36091#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36092#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:04:52,590 INFO L290 TraceCheckUtils]: 63: Hoare triple {36092#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36093#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 58))} is VALID [2022-04-28 03:04:52,590 INFO L290 TraceCheckUtils]: 64: Hoare triple {36093#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 58))} assume !(~y~0 % 4294967296 < 1024); {36031#false} is VALID [2022-04-28 03:04:52,590 INFO L272 TraceCheckUtils]: 65: Hoare triple {36031#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {36031#false} is VALID [2022-04-28 03:04:52,590 INFO L290 TraceCheckUtils]: 66: Hoare triple {36031#false} ~cond := #in~cond; {36031#false} is VALID [2022-04-28 03:04:52,590 INFO L290 TraceCheckUtils]: 67: Hoare triple {36031#false} assume 0 == ~cond; {36031#false} is VALID [2022-04-28 03:04:52,590 INFO L290 TraceCheckUtils]: 68: Hoare triple {36031#false} assume !false; {36031#false} is VALID [2022-04-28 03:04:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:52,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:52,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935225382] [2022-04-28 03:04:52,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935225382] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:52,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787258802] [2022-04-28 03:04:52,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:04:52,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:52,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:52,603 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:04:52,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-28 03:04:52,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:04:52,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:52,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 119 conjunts are in the unsatisfiable core [2022-04-28 03:04:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:52,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:53,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {36030#true} call ULTIMATE.init(); {36030#true} is VALID [2022-04-28 03:04:53,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {36030#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(12, 2);call #Ultimate.allocInit(12, 3); {36030#true} is VALID [2022-04-28 03:04:53,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {36030#true} assume true; {36030#true} is VALID [2022-04-28 03:04:53,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36030#true} {36030#true} #34#return; {36030#true} is VALID [2022-04-28 03:04:53,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {36030#true} call #t~ret5 := main(); {36030#true} is VALID [2022-04-28 03:04:53,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {36030#true} ~x~0 := 1;~y~0 := 0; {36035#(= main_~y~0 0)} is VALID [2022-04-28 03:04:53,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {36035#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36036#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:04:53,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {36036#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36037#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:04:53,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {36037#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36038#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:04:53,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {36038#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36039#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:04:53,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {36039#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36040#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:04:53,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {36040#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36041#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:04:53,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {36041#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36042#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:04:53,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {36042#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36043#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:04:53,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {36043#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36044#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:04:53,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {36044#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36045#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:04:53,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {36045#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36046#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:04:53,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {36046#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36047#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:04:53,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {36047#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36048#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:04:53,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {36048#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36049#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:04:53,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {36049#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36050#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:04:53,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {36050#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36051#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:04:53,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {36051#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36052#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:04:53,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {36052#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36053#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:04:53,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {36053#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36054#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:04:53,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {36054#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36055#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:04:53,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {36055#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36056#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:04:53,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {36056#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36057#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:04:53,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {36057#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36058#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:04:53,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {36058#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36059#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:04:53,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {36059#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36060#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:04:53,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {36060#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36061#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:04:53,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {36061#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36062#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:04:53,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {36062#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36063#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:04:53,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {36063#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36064#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:04:53,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {36064#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36065#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:04:53,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {36065#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36066#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:04:53,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {36066#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36067#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:04:53,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {36067#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36068#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:04:53,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {36068#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36069#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:04:53,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {36069#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36070#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:04:53,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {36070#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36071#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:04:53,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {36071#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36072#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:04:53,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {36072#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36073#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:04:53,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {36073#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36074#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:04:53,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {36074#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36075#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:04:53,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {36075#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36076#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:04:53,340 INFO L290 TraceCheckUtils]: 47: Hoare triple {36076#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36077#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:04:53,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {36077#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36078#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:04:53,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {36078#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36079#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:04:53,341 INFO L290 TraceCheckUtils]: 50: Hoare triple {36079#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36080#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:04:53,342 INFO L290 TraceCheckUtils]: 51: Hoare triple {36080#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36081#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:04:53,342 INFO L290 TraceCheckUtils]: 52: Hoare triple {36081#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36082#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:04:53,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {36082#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36083#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:04:53,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {36083#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36084#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:04:53,344 INFO L290 TraceCheckUtils]: 55: Hoare triple {36084#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36085#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:04:53,344 INFO L290 TraceCheckUtils]: 56: Hoare triple {36085#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36086#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:04:53,345 INFO L290 TraceCheckUtils]: 57: Hoare triple {36086#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36087#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:04:53,345 INFO L290 TraceCheckUtils]: 58: Hoare triple {36087#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36088#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:04:53,345 INFO L290 TraceCheckUtils]: 59: Hoare triple {36088#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36089#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:04:53,359 INFO L290 TraceCheckUtils]: 60: Hoare triple {36089#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36090#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:04:53,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {36090#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36091#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:04:53,361 INFO L290 TraceCheckUtils]: 62: Hoare triple {36091#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36092#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:04:53,361 INFO L290 TraceCheckUtils]: 63: Hoare triple {36092#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36287#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:04:53,361 INFO L290 TraceCheckUtils]: 64: Hoare triple {36287#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !(~y~0 % 4294967296 < 1024); {36031#false} is VALID [2022-04-28 03:04:53,362 INFO L272 TraceCheckUtils]: 65: Hoare triple {36031#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {36031#false} is VALID [2022-04-28 03:04:53,362 INFO L290 TraceCheckUtils]: 66: Hoare triple {36031#false} ~cond := #in~cond; {36031#false} is VALID [2022-04-28 03:04:53,362 INFO L290 TraceCheckUtils]: 67: Hoare triple {36031#false} assume 0 == ~cond; {36031#false} is VALID [2022-04-28 03:04:53,362 INFO L290 TraceCheckUtils]: 68: Hoare triple {36031#false} assume !false; {36031#false} is VALID [2022-04-28 03:04:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:53,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:58,353 INFO L290 TraceCheckUtils]: 68: Hoare triple {36031#false} assume !false; {36031#false} is VALID [2022-04-28 03:04:58,354 INFO L290 TraceCheckUtils]: 67: Hoare triple {36031#false} assume 0 == ~cond; {36031#false} is VALID [2022-04-28 03:04:58,354 INFO L290 TraceCheckUtils]: 66: Hoare triple {36031#false} ~cond := #in~cond; {36031#false} is VALID [2022-04-28 03:04:58,354 INFO L272 TraceCheckUtils]: 65: Hoare triple {36031#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {36031#false} is VALID [2022-04-28 03:04:58,354 INFO L290 TraceCheckUtils]: 64: Hoare triple {36315#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {36031#false} is VALID [2022-04-28 03:04:58,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {36319#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36315#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:04:58,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {36323#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36319#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {36327#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36323#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {36331#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36327#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,357 INFO L290 TraceCheckUtils]: 59: Hoare triple {36335#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36331#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {36339#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36335#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {36343#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36339#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {36347#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36343#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,359 INFO L290 TraceCheckUtils]: 55: Hoare triple {36351#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36347#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {36355#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36351#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {36359#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36355#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,361 INFO L290 TraceCheckUtils]: 52: Hoare triple {36363#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36359#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,363 INFO L290 TraceCheckUtils]: 51: Hoare triple {36367#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36363#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,363 INFO L290 TraceCheckUtils]: 50: Hoare triple {36371#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36367#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {36375#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36371#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {36379#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36375#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,365 INFO L290 TraceCheckUtils]: 47: Hoare triple {36383#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36379#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {36387#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36383#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {36391#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36387#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {36395#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36391#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {36399#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36395#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {36403#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36399#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {36407#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36403#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {36411#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36407#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {36415#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36411#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {36419#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36415#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {36423#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36419#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {36427#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36423#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {36431#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36427#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {36435#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36431#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {36439#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36435#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {36443#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36439#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {36447#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36443#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {36451#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36447#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {36455#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36451#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {36459#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36455#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {36463#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36459#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {36467#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36463#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {36471#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36467#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {36475#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36471#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {36479#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36475#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {36483#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36479#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {36487#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36483#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {36491#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36487#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {36495#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36491#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {36499#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36495#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {36503#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36499#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {36507#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36503#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {36511#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36507#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {36515#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36511#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {36519#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36515#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {36523#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36519#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {36527#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36523#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {36531#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36527#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {36535#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36531#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {36539#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36535#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {36543#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36539#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {36547#(< (mod (+ main_~y~0 58) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {36543#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {36030#true} ~x~0 := 1;~y~0 := 0; {36547#(< (mod (+ main_~y~0 58) 4294967296) 1024)} is VALID [2022-04-28 03:04:58,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {36030#true} call #t~ret5 := main(); {36030#true} is VALID [2022-04-28 03:04:58,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36030#true} {36030#true} #34#return; {36030#true} is VALID [2022-04-28 03:04:58,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {36030#true} assume true; {36030#true} is VALID [2022-04-28 03:04:58,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {36030#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(12, 2);call #Ultimate.allocInit(12, 3); {36030#true} is VALID [2022-04-28 03:04:58,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {36030#true} call ULTIMATE.init(); {36030#true} is VALID [2022-04-28 03:04:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:58,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787258802] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:58,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:58,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 122 [2022-04-28 03:04:58,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:58,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [267099717] [2022-04-28 03:04:58,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [267099717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:58,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:58,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-28 03:04:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18720598] [2022-04-28 03:04:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:58,391 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 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 69 [2022-04-28 03:04:58,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:58,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 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-28 03:04:58,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:58,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-28 03:04:58,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:58,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-28 03:04:58,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3840, Invalid=10922, Unknown=0, NotChecked=0, Total=14762 [2022-04-28 03:04:58,426 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 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-28 03:05:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:04,659 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 03:05:04,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-28 03:05:04,659 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 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 69 [2022-04-28 03:05:04,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 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-28 03:05:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-28 03:05:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 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-28 03:05:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-28 03:05:04,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 76 transitions. [2022-04-28 03:05:04,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:04,713 INFO L225 Difference]: With dead ends: 76 [2022-04-28 03:05:04,714 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 03:05:04,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=7673, Invalid=24907, Unknown=0, NotChecked=0, Total=32580 [2022-04-28 03:05:04,715 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3429 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:04,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 3548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3429 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 03:05:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 03:05:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-28 03:05:04,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:04,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:04,787 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:04,787 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:04,787 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 03:05:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 03:05:04,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:04,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:04,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:05:04,788 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:05:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:04,788 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 03:05:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 03:05:04,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:04,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:04,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:04,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-04-28 03:05:04,789 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2022-04-28 03:05:04,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:04,789 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-04-28 03:05:04,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 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-28 03:05:04,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 71 transitions. [2022-04-28 03:05:04,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 03:05:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 03:05:04,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:04,839 INFO L195 NwaCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:04,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-28 03:05:05,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116,SelfDestructingSolverStorable117 [2022-04-28 03:05:05,040 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash -18267082, now seen corresponding path program 117 times [2022-04-28 03:05:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:05,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101703638] [2022-04-28 03:05:05,878 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:05:05,879 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:05:05,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1560802167, now seen corresponding path program 1 times [2022-04-28 03:05:05,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:05,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439411579] [2022-04-28 03:05:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:05,885 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:05:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:05,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:05:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash -18267082, now seen corresponding path program 118 times [2022-04-28 03:05:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:05,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171087643] [2022-04-28 03:05:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:05,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:07,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:07,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {37187#(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(12, 2);call #Ultimate.allocInit(12, 3); {37122#true} is VALID [2022-04-28 03:05:07,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {37122#true} assume true; {37122#true} is VALID [2022-04-28 03:05:07,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37122#true} {37122#true} #34#return; {37122#true} is VALID [2022-04-28 03:05:07,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {37122#true} call ULTIMATE.init(); {37187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:05:07,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {37187#(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(12, 2);call #Ultimate.allocInit(12, 3); {37122#true} is VALID [2022-04-28 03:05:07,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {37122#true} assume true; {37122#true} is VALID [2022-04-28 03:05:07,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37122#true} {37122#true} #34#return; {37122#true} is VALID [2022-04-28 03:05:07,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {37122#true} call #t~ret5 := main(); {37122#true} is VALID [2022-04-28 03:05:07,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {37122#true} ~x~0 := 1;~y~0 := 0; {37127#(= main_~y~0 0)} is VALID [2022-04-28 03:05:07,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {37127#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:05:07,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {37128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:05:07,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {37129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:05:07,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {37130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:05:07,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {37131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:05:07,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {37132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:05:07,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {37133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:05:07,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {37134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:05:07,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {37135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37136#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:05:07,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {37136#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37137#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:05:07,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {37137#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37138#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:05:07,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {37138#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:05:07,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {37139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37140#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:05:07,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {37140#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37141#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:05:07,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {37141#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37142#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:05:07,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {37142#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37143#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:05:07,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {37143#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37144#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:05:07,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {37144#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37145#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:05:07,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {37145#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37146#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:05:07,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {37146#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37147#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:05:07,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {37147#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37148#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:05:07,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {37148#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37149#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:05:07,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {37149#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37150#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:05:07,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {37150#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37151#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:05:07,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {37151#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37152#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:05:07,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {37152#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37153#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:05:07,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {37153#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37154#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:05:07,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {37154#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37155#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:05:07,544 INFO L290 TraceCheckUtils]: 34: Hoare triple {37155#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37156#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:05:07,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {37156#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37157#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:05:07,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {37157#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37158#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:05:07,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {37158#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37159#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:05:07,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {37159#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37160#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:05:07,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {37160#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37161#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:05:07,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {37161#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37162#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:05:07,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {37162#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37163#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:05:07,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {37163#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37164#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:05:07,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {37164#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37165#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:05:07,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {37165#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37166#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:05:07,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {37166#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37167#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:05:07,550 INFO L290 TraceCheckUtils]: 46: Hoare triple {37167#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37168#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:05:07,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {37168#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37169#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:05:07,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {37169#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37170#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:05:07,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {37170#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37171#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:05:07,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {37171#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37172#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:05:07,552 INFO L290 TraceCheckUtils]: 51: Hoare triple {37172#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37173#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:05:07,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {37173#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37174#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:05:07,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {37174#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37175#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:05:07,553 INFO L290 TraceCheckUtils]: 54: Hoare triple {37175#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37176#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:05:07,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {37176#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37177#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:05:07,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {37177#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37178#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:05:07,555 INFO L290 TraceCheckUtils]: 57: Hoare triple {37178#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37179#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:05:07,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {37179#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37180#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:05:07,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {37180#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37181#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:05:07,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {37181#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37182#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:05:07,557 INFO L290 TraceCheckUtils]: 61: Hoare triple {37182#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37183#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:05:07,557 INFO L290 TraceCheckUtils]: 62: Hoare triple {37183#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37184#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:05:07,558 INFO L290 TraceCheckUtils]: 63: Hoare triple {37184#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37185#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:05:07,558 INFO L290 TraceCheckUtils]: 64: Hoare triple {37185#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37186#(and (<= main_~y~0 59) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:05:07,559 INFO L290 TraceCheckUtils]: 65: Hoare triple {37186#(and (<= main_~y~0 59) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {37123#false} is VALID [2022-04-28 03:05:07,559 INFO L272 TraceCheckUtils]: 66: Hoare triple {37123#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {37123#false} is VALID [2022-04-28 03:05:07,559 INFO L290 TraceCheckUtils]: 67: Hoare triple {37123#false} ~cond := #in~cond; {37123#false} is VALID [2022-04-28 03:05:07,559 INFO L290 TraceCheckUtils]: 68: Hoare triple {37123#false} assume 0 == ~cond; {37123#false} is VALID [2022-04-28 03:05:07,559 INFO L290 TraceCheckUtils]: 69: Hoare triple {37123#false} assume !false; {37123#false} is VALID [2022-04-28 03:05:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:07,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171087643] [2022-04-28 03:05:07,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171087643] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:07,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272435009] [2022-04-28 03:05:07,560 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:05:07,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:07,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:07,561 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:05:07,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-28 03:05:07,714 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:05:07,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:07,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 121 conjunts are in the unsatisfiable core [2022-04-28 03:05:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:07,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:08,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {37122#true} call ULTIMATE.init(); {37122#true} is VALID [2022-04-28 03:05:08,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {37122#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(12, 2);call #Ultimate.allocInit(12, 3); {37122#true} is VALID [2022-04-28 03:05:08,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {37122#true} assume true; {37122#true} is VALID [2022-04-28 03:05:08,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37122#true} {37122#true} #34#return; {37122#true} is VALID [2022-04-28 03:05:08,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {37122#true} call #t~ret5 := main(); {37122#true} is VALID [2022-04-28 03:05:08,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {37122#true} ~x~0 := 1;~y~0 := 0; {37127#(= main_~y~0 0)} is VALID [2022-04-28 03:05:08,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {37127#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:05:08,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {37128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:05:08,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {37129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:05:08,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {37130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:05:08,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {37131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:05:08,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {37132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:05:08,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {37133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:05:08,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {37134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:05:08,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {37135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37136#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:05:08,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {37136#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37137#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:05:08,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {37137#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37138#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:05:08,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {37138#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:05:08,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {37139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37140#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:05:08,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {37140#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37141#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:05:08,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {37141#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37142#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:05:08,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {37142#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37143#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:05:08,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {37143#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37144#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:05:08,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {37144#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37145#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:05:08,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {37145#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37146#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:05:08,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {37146#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37147#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:05:08,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {37147#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37148#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:05:08,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {37148#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37149#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:05:08,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {37149#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37150#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:05:08,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {37150#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37151#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:05:08,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {37151#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37152#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:05:08,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {37152#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37153#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:05:08,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {37153#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37154#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:05:08,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {37154#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37155#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:05:08,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {37155#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37156#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:05:08,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {37156#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37157#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:05:08,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {37157#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37158#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:05:08,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {37158#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37159#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:05:08,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {37159#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37160#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:05:08,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {37160#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37161#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:05:08,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {37161#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37162#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:05:08,397 INFO L290 TraceCheckUtils]: 41: Hoare triple {37162#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37163#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:05:08,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {37163#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37164#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:05:08,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {37164#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37165#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:05:08,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {37165#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37166#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:05:08,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {37166#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37167#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:05:08,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {37167#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37168#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:05:08,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {37168#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37169#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:05:08,401 INFO L290 TraceCheckUtils]: 48: Hoare triple {37169#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37170#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:05:08,401 INFO L290 TraceCheckUtils]: 49: Hoare triple {37170#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37171#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:05:08,402 INFO L290 TraceCheckUtils]: 50: Hoare triple {37171#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37172#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:05:08,402 INFO L290 TraceCheckUtils]: 51: Hoare triple {37172#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37173#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:05:08,402 INFO L290 TraceCheckUtils]: 52: Hoare triple {37173#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37174#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:05:08,403 INFO L290 TraceCheckUtils]: 53: Hoare triple {37174#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37175#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:05:08,403 INFO L290 TraceCheckUtils]: 54: Hoare triple {37175#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37176#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:05:08,404 INFO L290 TraceCheckUtils]: 55: Hoare triple {37176#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37177#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:05:08,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {37177#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37178#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:05:08,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {37178#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37179#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:05:08,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {37179#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37180#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:05:08,406 INFO L290 TraceCheckUtils]: 59: Hoare triple {37180#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37181#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:05:08,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {37181#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37182#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:05:08,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {37182#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37183#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:05:08,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {37183#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37184#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:05:08,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {37184#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37185#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:05:08,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {37185#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37383#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:05:08,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {37383#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {37123#false} is VALID [2022-04-28 03:05:08,409 INFO L272 TraceCheckUtils]: 66: Hoare triple {37123#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {37123#false} is VALID [2022-04-28 03:05:08,409 INFO L290 TraceCheckUtils]: 67: Hoare triple {37123#false} ~cond := #in~cond; {37123#false} is VALID [2022-04-28 03:05:08,409 INFO L290 TraceCheckUtils]: 68: Hoare triple {37123#false} assume 0 == ~cond; {37123#false} is VALID [2022-04-28 03:05:08,409 INFO L290 TraceCheckUtils]: 69: Hoare triple {37123#false} assume !false; {37123#false} is VALID [2022-04-28 03:05:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:08,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:13,484 INFO L290 TraceCheckUtils]: 69: Hoare triple {37123#false} assume !false; {37123#false} is VALID [2022-04-28 03:05:13,484 INFO L290 TraceCheckUtils]: 68: Hoare triple {37123#false} assume 0 == ~cond; {37123#false} is VALID [2022-04-28 03:05:13,484 INFO L290 TraceCheckUtils]: 67: Hoare triple {37123#false} ~cond := #in~cond; {37123#false} is VALID [2022-04-28 03:05:13,484 INFO L272 TraceCheckUtils]: 66: Hoare triple {37123#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {37123#false} is VALID [2022-04-28 03:05:13,484 INFO L290 TraceCheckUtils]: 65: Hoare triple {37411#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {37123#false} is VALID [2022-04-28 03:05:13,485 INFO L290 TraceCheckUtils]: 64: Hoare triple {37415#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37411#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:05:13,486 INFO L290 TraceCheckUtils]: 63: Hoare triple {37419#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37415#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,486 INFO L290 TraceCheckUtils]: 62: Hoare triple {37423#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37419#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,487 INFO L290 TraceCheckUtils]: 61: Hoare triple {37427#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37423#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {37431#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37427#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {37435#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37431#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,489 INFO L290 TraceCheckUtils]: 58: Hoare triple {37439#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37435#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,489 INFO L290 TraceCheckUtils]: 57: Hoare triple {37443#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37439#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,490 INFO L290 TraceCheckUtils]: 56: Hoare triple {37447#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37443#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {37451#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37447#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {37455#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37451#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {37459#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37455#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {37463#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37459#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,493 INFO L290 TraceCheckUtils]: 51: Hoare triple {37467#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37463#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,493 INFO L290 TraceCheckUtils]: 50: Hoare triple {37471#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37467#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {37475#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37471#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {37479#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37475#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,495 INFO L290 TraceCheckUtils]: 47: Hoare triple {37483#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37479#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {37487#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37483#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {37491#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37487#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {37495#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37491#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {37499#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37495#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {37503#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37499#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {37507#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37503#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {37511#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37507#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {37515#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37511#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {37519#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37515#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {37523#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37519#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,502 INFO L290 TraceCheckUtils]: 36: Hoare triple {37527#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37523#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {37531#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37527#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {37535#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37531#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {37539#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37535#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {37543#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37539#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {37547#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37543#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {37551#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37547#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {37555#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37551#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {37559#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37555#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {37563#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37559#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {37567#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37563#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {37571#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37567#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {37575#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37571#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {37579#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37575#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {37583#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37579#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {37587#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37583#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {37591#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37587#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {37595#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37591#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {37599#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37595#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {37603#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37599#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {37607#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37603#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {37611#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37607#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {37615#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37611#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {37619#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37615#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {37623#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37619#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {37627#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37623#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {37631#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37627#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {37635#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37631#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {37639#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37635#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {37643#(< (mod (+ main_~y~0 58) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37639#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {37647#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {37643#(< (mod (+ main_~y~0 58) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {37122#true} ~x~0 := 1;~y~0 := 0; {37647#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:13,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {37122#true} call #t~ret5 := main(); {37122#true} is VALID [2022-04-28 03:05:13,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37122#true} {37122#true} #34#return; {37122#true} is VALID [2022-04-28 03:05:13,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {37122#true} assume true; {37122#true} is VALID [2022-04-28 03:05:13,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {37122#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(12, 2);call #Ultimate.allocInit(12, 3); {37122#true} is VALID [2022-04-28 03:05:13,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {37122#true} call ULTIMATE.init(); {37122#true} is VALID [2022-04-28 03:05:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:13,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272435009] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:13,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:13,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 124 [2022-04-28 03:05:13,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:13,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101703638] [2022-04-28 03:05:13,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101703638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:13,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:13,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-28 03:05:13,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620181355] [2022-04-28 03:05:13,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:13,525 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 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 70 [2022-04-28 03:05:13,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:13,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 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-28 03:05:13,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:13,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-28 03:05:13,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:13,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-28 03:05:13,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3965, Invalid=11287, Unknown=0, NotChecked=0, Total=15252 [2022-04-28 03:05:13,560 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 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-28 03:05:20,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:20,212 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-28 03:05:20,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-28 03:05:20,212 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 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 70 [2022-04-28 03:05:20,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 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-28 03:05:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-28 03:05:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 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-28 03:05:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-28 03:05:20,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 77 transitions. [2022-04-28 03:05:20,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:20,257 INFO L225 Difference]: With dead ends: 77 [2022-04-28 03:05:20,257 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 03:05:20,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=7923, Invalid=25749, Unknown=0, NotChecked=0, Total=33672 [2022-04-28 03:05:20,259 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3627 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:20,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 3748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3627 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:05:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 03:05:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-04-28 03:05:20,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:20,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 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-28 03:05:20,328 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 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-28 03:05:20,328 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 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-28 03:05:20,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:20,329 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 03:05:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 03:05:20,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:20,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:20,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 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 72 states. [2022-04-28 03:05:20,329 INFO L87 Difference]: Start difference. First operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 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 72 states. [2022-04-28 03:05:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:20,330 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 03:05:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 03:05:20,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:20,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:20,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:20,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 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-28 03:05:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2022-04-28 03:05:20,330 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2022-04-28 03:05:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:20,331 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2022-04-28 03:05:20,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 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-28 03:05:20,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 72 transitions. [2022-04-28 03:05:20,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 03:05:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 03:05:20,393 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:20,393 INFO L195 NwaCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:20,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-28 03:05:20,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable119,SelfDestructingSolverStorable118 [2022-04-28 03:05:20,593 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:20,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:20,594 INFO L85 PathProgramCache]: Analyzing trace with hash -529818276, now seen corresponding path program 119 times [2022-04-28 03:05:20,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:20,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1814613636] [2022-04-28 03:05:21,322 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:05:21,323 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:05:21,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1619907511, now seen corresponding path program 1 times [2022-04-28 03:05:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:21,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008702845] [2022-04-28 03:05:21,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:21,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:21,329 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:05:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:21,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:05:21,331 INFO L85 PathProgramCache]: Analyzing trace with hash -529818276, now seen corresponding path program 120 times [2022-04-28 03:05:21,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:21,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366292661] [2022-04-28 03:05:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:22,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:22,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {38296#(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(12, 2);call #Ultimate.allocInit(12, 3); {38230#true} is VALID [2022-04-28 03:05:22,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {38230#true} assume true; {38230#true} is VALID [2022-04-28 03:05:22,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38230#true} {38230#true} #34#return; {38230#true} is VALID [2022-04-28 03:05:22,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {38230#true} call ULTIMATE.init(); {38296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:05:22,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {38296#(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(12, 2);call #Ultimate.allocInit(12, 3); {38230#true} is VALID [2022-04-28 03:05:22,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {38230#true} assume true; {38230#true} is VALID [2022-04-28 03:05:22,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38230#true} {38230#true} #34#return; {38230#true} is VALID [2022-04-28 03:05:22,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {38230#true} call #t~ret5 := main(); {38230#true} is VALID [2022-04-28 03:05:22,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {38230#true} ~x~0 := 1;~y~0 := 0; {38235#(= main_~y~0 0)} is VALID [2022-04-28 03:05:22,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {38235#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38236#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:05:22,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {38236#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38237#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:05:22,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {38237#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38238#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:05:22,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {38238#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38239#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:05:22,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {38239#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38240#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:05:22,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {38240#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38241#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:05:22,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {38241#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38242#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:05:22,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {38242#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38243#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:05:22,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {38243#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38244#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:05:23,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {38244#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38245#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:05:23,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {38245#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38246#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:05:23,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {38246#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38247#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:05:23,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {38247#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38248#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:05:23,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {38248#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38249#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:05:23,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {38249#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38250#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:05:23,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {38250#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38251#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:05:23,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {38251#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38252#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:05:23,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {38252#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38253#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:05:23,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {38253#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38254#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:05:23,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {38254#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38255#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:05:23,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {38255#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38256#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:05:23,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {38256#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38257#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:05:23,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {38257#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38258#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:05:23,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {38258#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38259#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:05:23,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {38259#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38260#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:05:23,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {38260#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38261#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:05:23,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {38261#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38262#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:05:23,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {38262#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38263#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:05:23,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {38263#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38264#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:05:23,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {38264#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38265#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:05:23,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {38265#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38266#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:05:23,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {38266#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38267#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:05:23,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {38267#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38268#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:05:23,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {38268#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38269#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:05:23,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {38269#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38270#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:05:23,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {38270#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38271#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:05:23,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {38271#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38272#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:05:23,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {38272#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38273#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:05:23,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {38273#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38274#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:05:23,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {38274#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38275#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:05:23,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {38275#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38276#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:05:23,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {38276#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38277#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:05:23,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {38277#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38278#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:05:23,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {38278#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38279#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:05:23,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {38279#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38280#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:05:23,016 INFO L290 TraceCheckUtils]: 51: Hoare triple {38280#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38281#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:05:23,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {38281#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38282#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:05:23,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {38282#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38283#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:05:23,018 INFO L290 TraceCheckUtils]: 54: Hoare triple {38283#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38284#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:05:23,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {38284#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38285#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:05:23,019 INFO L290 TraceCheckUtils]: 56: Hoare triple {38285#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38286#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:05:23,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {38286#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38287#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:05:23,020 INFO L290 TraceCheckUtils]: 58: Hoare triple {38287#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38288#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:05:23,020 INFO L290 TraceCheckUtils]: 59: Hoare triple {38288#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38289#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:05:23,020 INFO L290 TraceCheckUtils]: 60: Hoare triple {38289#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38290#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:05:23,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {38290#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38291#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:05:23,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {38291#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38292#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:05:23,022 INFO L290 TraceCheckUtils]: 63: Hoare triple {38292#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38293#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:05:23,022 INFO L290 TraceCheckUtils]: 64: Hoare triple {38293#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38294#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:05:23,023 INFO L290 TraceCheckUtils]: 65: Hoare triple {38294#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38295#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 60))} is VALID [2022-04-28 03:05:23,023 INFO L290 TraceCheckUtils]: 66: Hoare triple {38295#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 60))} assume !(~y~0 % 4294967296 < 1024); {38231#false} is VALID [2022-04-28 03:05:23,023 INFO L272 TraceCheckUtils]: 67: Hoare triple {38231#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {38231#false} is VALID [2022-04-28 03:05:23,023 INFO L290 TraceCheckUtils]: 68: Hoare triple {38231#false} ~cond := #in~cond; {38231#false} is VALID [2022-04-28 03:05:23,023 INFO L290 TraceCheckUtils]: 69: Hoare triple {38231#false} assume 0 == ~cond; {38231#false} is VALID [2022-04-28 03:05:23,024 INFO L290 TraceCheckUtils]: 70: Hoare triple {38231#false} assume !false; {38231#false} is VALID [2022-04-28 03:05:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:23,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:23,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366292661] [2022-04-28 03:05:23,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366292661] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:23,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571331413] [2022-04-28 03:05:23,024 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:05:23,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:23,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:23,025 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:05:23,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-28 03:05:42,751 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-28 03:05:42,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:42,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 123 conjunts are in the unsatisfiable core [2022-04-28 03:05:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:42,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:43,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {38230#true} call ULTIMATE.init(); {38230#true} is VALID [2022-04-28 03:05:43,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {38230#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(12, 2);call #Ultimate.allocInit(12, 3); {38230#true} is VALID [2022-04-28 03:05:43,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {38230#true} assume true; {38230#true} is VALID [2022-04-28 03:05:43,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38230#true} {38230#true} #34#return; {38230#true} is VALID [2022-04-28 03:05:43,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {38230#true} call #t~ret5 := main(); {38230#true} is VALID [2022-04-28 03:05:43,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {38230#true} ~x~0 := 1;~y~0 := 0; {38235#(= main_~y~0 0)} is VALID [2022-04-28 03:05:43,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {38235#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38236#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:05:43,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {38236#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38237#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:05:43,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {38237#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38238#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:05:43,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {38238#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38239#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:05:43,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {38239#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38240#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:05:43,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {38240#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38241#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:05:43,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {38241#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38242#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:05:43,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {38242#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38243#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:05:43,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {38243#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38244#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:05:43,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {38244#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38245#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:05:43,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {38245#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38246#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:05:43,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {38246#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38247#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:05:43,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {38247#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38248#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:05:43,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {38248#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38249#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:05:43,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {38249#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38250#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:05:43,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {38250#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38251#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:05:43,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {38251#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38252#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:05:43,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {38252#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38253#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:05:43,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {38253#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38254#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:05:43,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {38254#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38255#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:05:43,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {38255#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38256#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:05:43,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {38256#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38257#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:05:43,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {38257#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38258#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:05:43,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {38258#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38259#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:05:43,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {38259#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38260#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:05:43,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {38260#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38261#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:05:43,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {38261#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38262#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:05:43,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {38262#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38263#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:05:43,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {38263#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38264#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:05:43,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {38264#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38265#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:05:43,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {38265#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38266#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:05:43,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {38266#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38267#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:05:43,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {38267#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38268#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:05:43,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {38268#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38269#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:05:43,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {38269#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38270#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:05:43,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {38270#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38271#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:05:43,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {38271#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38272#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:05:43,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {38272#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38273#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:05:43,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {38273#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38274#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:05:43,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {38274#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38275#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:05:43,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {38275#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38276#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:05:43,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {38276#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38277#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:05:43,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {38277#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38278#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:05:43,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {38278#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38279#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:05:43,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {38279#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38280#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:05:43,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {38280#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38281#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:05:43,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {38281#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38282#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:05:43,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {38282#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38283#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:05:43,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {38283#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38284#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:05:43,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {38284#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38285#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:05:43,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {38285#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38286#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:05:43,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {38286#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38287#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:05:43,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {38287#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38288#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:05:43,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {38288#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38289#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:05:43,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {38289#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38290#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:05:43,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {38290#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38291#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:05:43,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {38291#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38292#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:05:43,409 INFO L290 TraceCheckUtils]: 63: Hoare triple {38292#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38293#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:05:43,410 INFO L290 TraceCheckUtils]: 64: Hoare triple {38293#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38294#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:05:43,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {38294#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38495#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:05:43,411 INFO L290 TraceCheckUtils]: 66: Hoare triple {38495#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !(~y~0 % 4294967296 < 1024); {38231#false} is VALID [2022-04-28 03:05:43,411 INFO L272 TraceCheckUtils]: 67: Hoare triple {38231#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {38231#false} is VALID [2022-04-28 03:05:43,411 INFO L290 TraceCheckUtils]: 68: Hoare triple {38231#false} ~cond := #in~cond; {38231#false} is VALID [2022-04-28 03:05:43,411 INFO L290 TraceCheckUtils]: 69: Hoare triple {38231#false} assume 0 == ~cond; {38231#false} is VALID [2022-04-28 03:05:43,411 INFO L290 TraceCheckUtils]: 70: Hoare triple {38231#false} assume !false; {38231#false} is VALID [2022-04-28 03:05:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:43,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:48,725 INFO L290 TraceCheckUtils]: 70: Hoare triple {38231#false} assume !false; {38231#false} is VALID [2022-04-28 03:05:48,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {38231#false} assume 0 == ~cond; {38231#false} is VALID [2022-04-28 03:05:48,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {38231#false} ~cond := #in~cond; {38231#false} is VALID [2022-04-28 03:05:48,726 INFO L272 TraceCheckUtils]: 67: Hoare triple {38231#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {38231#false} is VALID [2022-04-28 03:05:48,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {38523#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {38231#false} is VALID [2022-04-28 03:05:48,727 INFO L290 TraceCheckUtils]: 65: Hoare triple {38527#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38523#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:05:48,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {38531#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38527#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {38535#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38531#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,729 INFO L290 TraceCheckUtils]: 62: Hoare triple {38539#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38535#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {38543#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38539#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {38547#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38543#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,730 INFO L290 TraceCheckUtils]: 59: Hoare triple {38551#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38547#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {38555#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38551#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,732 INFO L290 TraceCheckUtils]: 57: Hoare triple {38559#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38555#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,732 INFO L290 TraceCheckUtils]: 56: Hoare triple {38563#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38559#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,733 INFO L290 TraceCheckUtils]: 55: Hoare triple {38567#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38563#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {38571#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38567#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {38575#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38571#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {38579#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38575#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {38583#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38579#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {38587#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38583#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {38591#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38587#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {38595#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38591#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {38599#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38595#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {38603#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38599#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {38607#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38603#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {38611#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38607#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {38615#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38611#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {38619#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38615#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {38623#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38619#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,743 INFO L290 TraceCheckUtils]: 40: Hoare triple {38627#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38623#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,743 INFO L290 TraceCheckUtils]: 39: Hoare triple {38631#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38627#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {38635#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38631#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {38639#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38635#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {38643#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38639#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {38647#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38643#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,746 INFO L290 TraceCheckUtils]: 34: Hoare triple {38651#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38647#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {38655#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38651#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {38659#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38655#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {38663#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38659#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {38667#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38663#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {38671#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38667#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {38675#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38671#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {38679#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38675#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {38683#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38679#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {38687#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38683#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {38691#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38687#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {38695#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38691#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {38699#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38695#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {38703#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38699#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {38707#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38703#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {38711#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38707#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {38715#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38711#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {38719#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38715#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {38723#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38719#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {38727#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38723#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {38731#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38727#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {38735#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38731#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {38739#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38735#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {38743#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38739#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {38747#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38743#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {38751#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38747#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {38755#(< (mod (+ main_~y~0 58) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38751#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {38759#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38755#(< (mod (+ main_~y~0 58) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {38763#(< (mod (+ main_~y~0 60) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {38759#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {38230#true} ~x~0 := 1;~y~0 := 0; {38763#(< (mod (+ main_~y~0 60) 4294967296) 1024)} is VALID [2022-04-28 03:05:48,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {38230#true} call #t~ret5 := main(); {38230#true} is VALID [2022-04-28 03:05:48,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38230#true} {38230#true} #34#return; {38230#true} is VALID [2022-04-28 03:05:48,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {38230#true} assume true; {38230#true} is VALID [2022-04-28 03:05:48,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {38230#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(12, 2);call #Ultimate.allocInit(12, 3); {38230#true} is VALID [2022-04-28 03:05:48,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {38230#true} call ULTIMATE.init(); {38230#true} is VALID [2022-04-28 03:05:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:48,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571331413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:48,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:48,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 126 [2022-04-28 03:05:48,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:48,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1814613636] [2022-04-28 03:05:48,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1814613636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:48,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:48,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-28 03:05:48,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723662916] [2022-04-28 03:05:48,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:48,766 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 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 71 [2022-04-28 03:05:48,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:48,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 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-28 03:05:48,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:48,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-28 03:05:48,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:48,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-28 03:05:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4092, Invalid=11658, Unknown=0, NotChecked=0, Total=15750 [2022-04-28 03:05:48,809 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 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-28 03:05:55,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:55,604 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 03:05:55,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-28 03:05:55,604 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 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 71 [2022-04-28 03:05:55,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 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-28 03:05:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-28 03:05:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 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-28 03:05:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-28 03:05:55,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 78 transitions. [2022-04-28 03:05:55,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:55,651 INFO L225 Difference]: With dead ends: 78 [2022-04-28 03:05:55,651 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 03:05:55,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1956 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=8177, Invalid=26605, Unknown=0, NotChecked=0, Total=34782 [2022-04-28 03:05:55,653 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 3692 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 3815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 3692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:55,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 3815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 3692 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:05:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 03:05:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-28 03:05:55,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:55,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 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-28 03:05:55,724 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 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-28 03:05:55,724 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 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-28 03:05:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:55,725 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-28 03:05:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 03:05:55,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:55,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:55,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 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 73 states. [2022-04-28 03:05:55,725 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 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 73 states. [2022-04-28 03:05:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:55,726 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-28 03:05:55,726 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 03:05:55,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:55,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:55,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:55,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 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-28 03:05:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2022-04-28 03:05:55,727 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2022-04-28 03:05:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:55,727 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2022-04-28 03:05:55,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 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-28 03:05:55,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 73 transitions. [2022-04-28 03:05:55,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 03:05:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 03:05:55,778 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:55,778 INFO L195 NwaCegarLoop]: trace histogram [61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:55,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-28 03:05:55,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,SelfDestructingSolverStorable121,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:55,979 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:55,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash 791963894, now seen corresponding path program 121 times [2022-04-28 03:05:55,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:55,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [531771693] [2022-04-28 03:05:56,283 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:05:56,284 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:05:56,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1679012855, now seen corresponding path program 1 times [2022-04-28 03:05:56,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:56,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549888247] [2022-04-28 03:05:56,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:56,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:56,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:05:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:56,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:05:56,294 INFO L85 PathProgramCache]: Analyzing trace with hash 791963894, now seen corresponding path program 122 times [2022-04-28 03:05:56,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:56,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036221157] [2022-04-28 03:05:56,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:56,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:58,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:58,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {39421#(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(12, 2);call #Ultimate.allocInit(12, 3); {39354#true} is VALID [2022-04-28 03:05:58,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {39354#true} assume true; {39354#true} is VALID [2022-04-28 03:05:58,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39354#true} {39354#true} #34#return; {39354#true} is VALID [2022-04-28 03:05:58,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {39354#true} call ULTIMATE.init(); {39421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:05:58,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {39421#(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(12, 2);call #Ultimate.allocInit(12, 3); {39354#true} is VALID [2022-04-28 03:05:58,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {39354#true} assume true; {39354#true} is VALID [2022-04-28 03:05:58,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39354#true} {39354#true} #34#return; {39354#true} is VALID [2022-04-28 03:05:58,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {39354#true} call #t~ret5 := main(); {39354#true} is VALID [2022-04-28 03:05:58,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {39354#true} ~x~0 := 1;~y~0 := 0; {39359#(= main_~y~0 0)} is VALID [2022-04-28 03:05:58,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {39359#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39360#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:05:58,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {39360#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:05:58,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {39361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39362#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:05:58,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {39362#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39363#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:05:58,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {39363#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39364#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:05:58,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {39364#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39365#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:05:58,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {39365#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:05:58,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {39366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:05:58,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {39367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39368#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:05:58,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {39368#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39369#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:05:58,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {39369#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39370#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:05:58,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {39370#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39371#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:05:58,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {39371#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:05:58,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {39372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39373#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:05:58,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {39373#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39374#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:05:58,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {39374#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39375#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:05:58,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {39375#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39376#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:05:58,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {39376#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39377#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:05:58,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {39377#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39378#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:05:58,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {39378#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39379#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:05:58,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {39379#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39380#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:05:58,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {39380#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39381#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:05:58,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {39381#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39382#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:05:58,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {39382#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39383#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:05:58,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {39383#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39384#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:05:58,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {39384#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39385#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:05:58,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {39385#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39386#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:05:58,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {39386#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39387#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:05:58,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {39387#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39388#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:05:58,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {39388#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39389#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:05:58,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {39389#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39390#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:05:58,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {39390#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39391#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:05:58,075 INFO L290 TraceCheckUtils]: 38: Hoare triple {39391#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39392#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:05:58,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {39392#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39393#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:05:58,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {39393#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39394#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:05:58,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {39394#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39395#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:05:58,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {39395#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39396#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:05:58,078 INFO L290 TraceCheckUtils]: 43: Hoare triple {39396#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39397#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:05:58,078 INFO L290 TraceCheckUtils]: 44: Hoare triple {39397#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39398#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:05:58,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {39398#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39399#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:05:58,079 INFO L290 TraceCheckUtils]: 46: Hoare triple {39399#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39400#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:05:58,080 INFO L290 TraceCheckUtils]: 47: Hoare triple {39400#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39401#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:05:58,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {39401#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39402#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:05:58,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {39402#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39403#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:05:58,081 INFO L290 TraceCheckUtils]: 50: Hoare triple {39403#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39404#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:05:58,081 INFO L290 TraceCheckUtils]: 51: Hoare triple {39404#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39405#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:05:58,082 INFO L290 TraceCheckUtils]: 52: Hoare triple {39405#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39406#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:05:58,082 INFO L290 TraceCheckUtils]: 53: Hoare triple {39406#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39407#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:05:58,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {39407#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39408#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:05:58,083 INFO L290 TraceCheckUtils]: 55: Hoare triple {39408#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39409#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:05:58,084 INFO L290 TraceCheckUtils]: 56: Hoare triple {39409#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39410#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:05:58,084 INFO L290 TraceCheckUtils]: 57: Hoare triple {39410#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39411#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:05:58,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {39411#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39412#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:05:58,085 INFO L290 TraceCheckUtils]: 59: Hoare triple {39412#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39413#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:05:58,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {39413#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39414#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:05:58,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {39414#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39415#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:05:58,087 INFO L290 TraceCheckUtils]: 62: Hoare triple {39415#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39416#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:05:58,087 INFO L290 TraceCheckUtils]: 63: Hoare triple {39416#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39417#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:05:58,088 INFO L290 TraceCheckUtils]: 64: Hoare triple {39417#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39418#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:05:58,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {39418#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39419#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:05:58,089 INFO L290 TraceCheckUtils]: 66: Hoare triple {39419#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39420#(and (<= main_~y~0 61) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:05:58,089 INFO L290 TraceCheckUtils]: 67: Hoare triple {39420#(and (<= main_~y~0 61) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {39355#false} is VALID [2022-04-28 03:05:58,089 INFO L272 TraceCheckUtils]: 68: Hoare triple {39355#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {39355#false} is VALID [2022-04-28 03:05:58,089 INFO L290 TraceCheckUtils]: 69: Hoare triple {39355#false} ~cond := #in~cond; {39355#false} is VALID [2022-04-28 03:05:58,089 INFO L290 TraceCheckUtils]: 70: Hoare triple {39355#false} assume 0 == ~cond; {39355#false} is VALID [2022-04-28 03:05:58,089 INFO L290 TraceCheckUtils]: 71: Hoare triple {39355#false} assume !false; {39355#false} is VALID [2022-04-28 03:05:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:58,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036221157] [2022-04-28 03:05:58,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036221157] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159977687] [2022-04-28 03:05:58,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:05:58,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:58,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:58,091 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:05:58,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-28 03:05:58,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:05:58,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:58,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 125 conjunts are in the unsatisfiable core [2022-04-28 03:05:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:58,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:58,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {39354#true} call ULTIMATE.init(); {39354#true} is VALID [2022-04-28 03:05:58,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {39354#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(12, 2);call #Ultimate.allocInit(12, 3); {39354#true} is VALID [2022-04-28 03:05:58,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {39354#true} assume true; {39354#true} is VALID [2022-04-28 03:05:58,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39354#true} {39354#true} #34#return; {39354#true} is VALID [2022-04-28 03:05:58,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {39354#true} call #t~ret5 := main(); {39354#true} is VALID [2022-04-28 03:05:58,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {39354#true} ~x~0 := 1;~y~0 := 0; {39359#(= main_~y~0 0)} is VALID [2022-04-28 03:05:58,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {39359#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39360#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:05:58,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {39360#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:05:58,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {39361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39362#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:05:58,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {39362#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39363#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:05:58,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {39363#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39364#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:05:58,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {39364#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39365#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:05:58,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {39365#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:05:58,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {39366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:05:58,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {39367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39368#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:05:58,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {39368#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39369#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:05:58,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {39369#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39370#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:05:58,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {39370#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39371#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:05:58,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {39371#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:05:58,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {39372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39373#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:05:58,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {39373#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39374#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:05:58,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {39374#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39375#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:05:58,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {39375#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39376#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:05:58,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {39376#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39377#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:05:58,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {39377#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39378#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:05:58,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {39378#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39379#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:05:58,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {39379#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39380#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:05:58,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {39380#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39381#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:05:58,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {39381#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39382#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:05:58,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {39382#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39383#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:05:58,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {39383#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39384#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:05:58,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {39384#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39385#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:05:58,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {39385#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39386#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:05:58,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {39386#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39387#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:05:58,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {39387#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39388#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:05:58,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {39388#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39389#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:05:58,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {39389#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39390#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:05:58,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {39390#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39391#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:05:58,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {39391#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39392#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:05:58,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {39392#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39393#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:05:58,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {39393#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39394#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:05:58,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {39394#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39395#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:05:58,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {39395#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39396#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:05:58,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {39396#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39397#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:05:58,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {39397#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39398#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:05:58,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {39398#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39399#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:05:58,943 INFO L290 TraceCheckUtils]: 46: Hoare triple {39399#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39400#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:05:58,943 INFO L290 TraceCheckUtils]: 47: Hoare triple {39400#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39401#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:05:58,944 INFO L290 TraceCheckUtils]: 48: Hoare triple {39401#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39402#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:05:58,944 INFO L290 TraceCheckUtils]: 49: Hoare triple {39402#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39403#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:05:58,945 INFO L290 TraceCheckUtils]: 50: Hoare triple {39403#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39404#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:05:58,945 INFO L290 TraceCheckUtils]: 51: Hoare triple {39404#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39405#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:05:58,946 INFO L290 TraceCheckUtils]: 52: Hoare triple {39405#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39406#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:05:58,946 INFO L290 TraceCheckUtils]: 53: Hoare triple {39406#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39407#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:05:58,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {39407#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39408#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:05:58,947 INFO L290 TraceCheckUtils]: 55: Hoare triple {39408#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39409#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:05:58,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {39409#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39410#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:05:58,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {39410#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39411#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:05:58,949 INFO L290 TraceCheckUtils]: 58: Hoare triple {39411#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39412#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:05:58,949 INFO L290 TraceCheckUtils]: 59: Hoare triple {39412#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39413#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:05:58,949 INFO L290 TraceCheckUtils]: 60: Hoare triple {39413#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39414#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:05:58,950 INFO L290 TraceCheckUtils]: 61: Hoare triple {39414#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39415#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:05:58,950 INFO L290 TraceCheckUtils]: 62: Hoare triple {39415#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39416#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:05:58,951 INFO L290 TraceCheckUtils]: 63: Hoare triple {39416#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39417#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:05:58,951 INFO L290 TraceCheckUtils]: 64: Hoare triple {39417#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39418#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:05:58,952 INFO L290 TraceCheckUtils]: 65: Hoare triple {39418#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39419#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:05:58,952 INFO L290 TraceCheckUtils]: 66: Hoare triple {39419#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39623#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:05:58,953 INFO L290 TraceCheckUtils]: 67: Hoare triple {39623#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {39355#false} is VALID [2022-04-28 03:05:58,953 INFO L272 TraceCheckUtils]: 68: Hoare triple {39355#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {39355#false} is VALID [2022-04-28 03:05:58,953 INFO L290 TraceCheckUtils]: 69: Hoare triple {39355#false} ~cond := #in~cond; {39355#false} is VALID [2022-04-28 03:05:58,953 INFO L290 TraceCheckUtils]: 70: Hoare triple {39355#false} assume 0 == ~cond; {39355#false} is VALID [2022-04-28 03:05:58,953 INFO L290 TraceCheckUtils]: 71: Hoare triple {39355#false} assume !false; {39355#false} is VALID [2022-04-28 03:05:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:58,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:04,492 INFO L290 TraceCheckUtils]: 71: Hoare triple {39355#false} assume !false; {39355#false} is VALID [2022-04-28 03:06:04,493 INFO L290 TraceCheckUtils]: 70: Hoare triple {39355#false} assume 0 == ~cond; {39355#false} is VALID [2022-04-28 03:06:04,493 INFO L290 TraceCheckUtils]: 69: Hoare triple {39355#false} ~cond := #in~cond; {39355#false} is VALID [2022-04-28 03:06:04,493 INFO L272 TraceCheckUtils]: 68: Hoare triple {39355#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {39355#false} is VALID [2022-04-28 03:06:04,493 INFO L290 TraceCheckUtils]: 67: Hoare triple {39651#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {39355#false} is VALID [2022-04-28 03:06:04,494 INFO L290 TraceCheckUtils]: 66: Hoare triple {39655#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39651#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:06:04,494 INFO L290 TraceCheckUtils]: 65: Hoare triple {39659#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39655#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,495 INFO L290 TraceCheckUtils]: 64: Hoare triple {39663#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39659#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {39667#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39663#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {39671#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39667#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,497 INFO L290 TraceCheckUtils]: 61: Hoare triple {39675#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39671#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,497 INFO L290 TraceCheckUtils]: 60: Hoare triple {39679#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39675#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {39683#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39679#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {39687#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39683#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {39691#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39687#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {39695#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39691#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {39699#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39695#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {39703#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39699#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {39707#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39703#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {39711#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39707#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {39715#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39711#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {39719#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39715#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {39723#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39719#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {39727#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39723#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,506 INFO L290 TraceCheckUtils]: 47: Hoare triple {39731#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39727#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,508 INFO L290 TraceCheckUtils]: 46: Hoare triple {39735#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39731#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,508 INFO L290 TraceCheckUtils]: 45: Hoare triple {39739#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39735#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {39743#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39739#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {39747#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39743#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {39751#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39747#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {39755#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39751#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {39759#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39755#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {39763#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39759#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {39767#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39763#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {39771#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39767#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {39775#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39771#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {39779#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39775#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {39783#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39779#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {39787#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39783#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {39791#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39787#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {39795#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39791#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {39799#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39795#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {39803#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39799#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {39807#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39803#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {39811#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39807#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {39815#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39811#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {39819#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39815#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {39823#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39819#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {39827#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39823#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {39831#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39827#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {39835#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39831#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {39839#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39835#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {39843#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39839#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {39847#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39843#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {39851#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39847#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {39855#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39851#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {39859#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39855#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {39863#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39859#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {39867#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39863#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {39871#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39867#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {39875#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39871#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {39879#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39875#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {39883#(< (mod (+ main_~y~0 58) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39879#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {39887#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39883#(< (mod (+ main_~y~0 58) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {39891#(< (mod (+ main_~y~0 60) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39887#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {39895#(< (mod (+ main_~y~0 61) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {39891#(< (mod (+ main_~y~0 60) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {39354#true} ~x~0 := 1;~y~0 := 0; {39895#(< (mod (+ main_~y~0 61) 4294967296) 1024)} is VALID [2022-04-28 03:06:04,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {39354#true} call #t~ret5 := main(); {39354#true} is VALID [2022-04-28 03:06:04,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39354#true} {39354#true} #34#return; {39354#true} is VALID [2022-04-28 03:06:04,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {39354#true} assume true; {39354#true} is VALID [2022-04-28 03:06:04,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {39354#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(12, 2);call #Ultimate.allocInit(12, 3); {39354#true} is VALID [2022-04-28 03:06:04,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {39354#true} call ULTIMATE.init(); {39354#true} is VALID [2022-04-28 03:06:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:04,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159977687] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:04,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:04,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 128 [2022-04-28 03:06:04,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:04,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [531771693] [2022-04-28 03:06:04,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [531771693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:04,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:04,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-28 03:06:04,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870720792] [2022-04-28 03:06:04,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:04,535 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 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 72 [2022-04-28 03:06:04,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:04,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 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-28 03:06:04,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:04,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-28 03:06:04,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:04,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-28 03:06:04,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4221, Invalid=12035, Unknown=0, NotChecked=0, Total=16256 [2022-04-28 03:06:04,572 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 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-28 03:06:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:11,879 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-28 03:06:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-28 03:06:11,880 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 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 72 [2022-04-28 03:06:11,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 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-28 03:06:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2022-04-28 03:06:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 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-28 03:06:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2022-04-28 03:06:11,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 79 transitions. [2022-04-28 03:06:11,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:11,933 INFO L225 Difference]: With dead ends: 79 [2022-04-28 03:06:11,933 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 03:06:11,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=8435, Invalid=27475, Unknown=0, NotChecked=0, Total=35910 [2022-04-28 03:06:11,934 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 4019 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 4144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 4019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:06:11,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 248 Invalid, 4144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 4019 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 03:06:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 03:06:12,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-28 03:06:12,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:12,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 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-28 03:06:12,056 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 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-28 03:06:12,056 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 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-28 03:06:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:12,056 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 03:06:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-28 03:06:12,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:12,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:12,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-28 03:06:12,057 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-28 03:06:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:12,057 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 03:06:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-28 03:06:12,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:12,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:12,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:12,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 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-28 03:06:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2022-04-28 03:06:12,058 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2022-04-28 03:06:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:12,058 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2022-04-28 03:06:12,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 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-28 03:06:12,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 74 transitions. [2022-04-28 03:06:12,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-28 03:06:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 03:06:12,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:12,113 INFO L195 NwaCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:12,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-28 03:06:12,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122,SelfDestructingSolverStorable123 [2022-04-28 03:06:12,314 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:12,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1182461796, now seen corresponding path program 123 times [2022-04-28 03:06:12,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:12,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [289989642] [2022-04-28 03:06:12,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:06:12,691 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:06:12,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1738118199, now seen corresponding path program 1 times [2022-04-28 03:06:12,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:12,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763069369] [2022-04-28 03:06:12,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:12,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:06:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:12,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:06:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1182461796, now seen corresponding path program 124 times [2022-04-28 03:06:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:12,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562810748] [2022-04-28 03:06:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:14,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:14,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {40562#(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(12, 2);call #Ultimate.allocInit(12, 3); {40494#true} is VALID [2022-04-28 03:06:14,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {40494#true} assume true; {40494#true} is VALID [2022-04-28 03:06:14,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40494#true} {40494#true} #34#return; {40494#true} is VALID [2022-04-28 03:06:14,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {40494#true} call ULTIMATE.init(); {40562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:06:14,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {40562#(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(12, 2);call #Ultimate.allocInit(12, 3); {40494#true} is VALID [2022-04-28 03:06:14,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {40494#true} assume true; {40494#true} is VALID [2022-04-28 03:06:14,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40494#true} {40494#true} #34#return; {40494#true} is VALID [2022-04-28 03:06:14,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {40494#true} call #t~ret5 := main(); {40494#true} is VALID [2022-04-28 03:06:14,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {40494#true} ~x~0 := 1;~y~0 := 0; {40499#(= main_~y~0 0)} is VALID [2022-04-28 03:06:14,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {40499#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40500#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:06:14,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {40500#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40501#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:06:14,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {40501#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40502#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:06:14,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {40502#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40503#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:06:14,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {40503#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40504#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:06:14,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {40504#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40505#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:06:14,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {40505#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40506#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:06:14,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {40506#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40507#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:06:14,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {40507#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40508#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:06:14,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {40508#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40509#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:06:14,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {40509#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40510#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:06:14,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {40510#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40511#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:06:14,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {40511#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40512#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:06:14,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {40512#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40513#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:06:14,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {40513#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40514#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:06:14,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {40514#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40515#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:06:14,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {40515#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40516#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:06:14,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {40516#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40517#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:06:14,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {40517#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40518#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:06:14,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {40518#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40519#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:06:14,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {40519#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40520#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:06:14,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {40520#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40521#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:06:14,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {40521#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40522#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:06:14,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {40522#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40523#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:06:14,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {40523#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40524#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:06:14,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {40524#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40525#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:06:14,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {40525#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40526#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:06:14,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {40526#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40527#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:06:14,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {40527#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40528#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:06:14,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {40528#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40529#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:06:14,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {40529#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40530#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:06:14,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {40530#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40531#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:06:14,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {40531#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40532#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:06:14,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {40532#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40533#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:06:14,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {40533#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40534#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:06:14,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {40534#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40535#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:06:14,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {40535#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40536#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:06:14,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {40536#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40537#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:06:14,515 INFO L290 TraceCheckUtils]: 44: Hoare triple {40537#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40538#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:06:14,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {40538#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40539#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:06:14,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {40539#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40540#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:06:14,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {40540#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40541#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:06:14,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {40541#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40542#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:06:14,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {40542#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40543#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:06:14,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {40543#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40544#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:06:14,518 INFO L290 TraceCheckUtils]: 51: Hoare triple {40544#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40545#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:06:14,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {40545#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40546#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:06:14,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {40546#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40547#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:06:14,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {40547#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40548#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:06:14,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {40548#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40549#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:06:14,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {40549#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40550#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:06:14,521 INFO L290 TraceCheckUtils]: 57: Hoare triple {40550#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40551#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:06:14,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {40551#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40552#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:06:14,522 INFO L290 TraceCheckUtils]: 59: Hoare triple {40552#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40553#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:06:14,522 INFO L290 TraceCheckUtils]: 60: Hoare triple {40553#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40554#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:06:14,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {40554#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40555#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:06:14,523 INFO L290 TraceCheckUtils]: 62: Hoare triple {40555#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40556#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:06:14,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {40556#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40557#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:06:14,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {40557#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40558#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:06:14,525 INFO L290 TraceCheckUtils]: 65: Hoare triple {40558#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40559#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:06:14,525 INFO L290 TraceCheckUtils]: 66: Hoare triple {40559#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40560#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:06:14,526 INFO L290 TraceCheckUtils]: 67: Hoare triple {40560#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40561#(and (<= main_~y~0 62) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:06:14,526 INFO L290 TraceCheckUtils]: 68: Hoare triple {40561#(and (<= main_~y~0 62) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {40495#false} is VALID [2022-04-28 03:06:14,526 INFO L272 TraceCheckUtils]: 69: Hoare triple {40495#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {40495#false} is VALID [2022-04-28 03:06:14,526 INFO L290 TraceCheckUtils]: 70: Hoare triple {40495#false} ~cond := #in~cond; {40495#false} is VALID [2022-04-28 03:06:14,526 INFO L290 TraceCheckUtils]: 71: Hoare triple {40495#false} assume 0 == ~cond; {40495#false} is VALID [2022-04-28 03:06:14,526 INFO L290 TraceCheckUtils]: 72: Hoare triple {40495#false} assume !false; {40495#false} is VALID [2022-04-28 03:06:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:14,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:14,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562810748] [2022-04-28 03:06:14,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562810748] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:14,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774762071] [2022-04-28 03:06:14,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:06:14,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:14,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:14,528 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:06:14,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-28 03:06:14,676 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:06:14,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:06:14,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 127 conjunts are in the unsatisfiable core [2022-04-28 03:06:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:14,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:06:15,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {40494#true} call ULTIMATE.init(); {40494#true} is VALID [2022-04-28 03:06:15,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {40494#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(12, 2);call #Ultimate.allocInit(12, 3); {40494#true} is VALID [2022-04-28 03:06:15,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {40494#true} assume true; {40494#true} is VALID [2022-04-28 03:06:15,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40494#true} {40494#true} #34#return; {40494#true} is VALID [2022-04-28 03:06:15,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {40494#true} call #t~ret5 := main(); {40494#true} is VALID [2022-04-28 03:06:15,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {40494#true} ~x~0 := 1;~y~0 := 0; {40499#(= main_~y~0 0)} is VALID [2022-04-28 03:06:15,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {40499#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40500#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:06:15,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {40500#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40501#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:06:15,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {40501#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40502#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:06:15,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {40502#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40503#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:06:15,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {40503#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40504#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:06:15,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {40504#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40505#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:06:15,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {40505#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40506#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:06:15,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {40506#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40507#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:06:15,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {40507#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40508#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:06:15,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {40508#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40509#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:06:15,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {40509#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40510#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:06:15,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {40510#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40511#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:06:15,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {40511#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40512#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:06:15,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {40512#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40513#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:06:15,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {40513#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40514#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:06:15,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {40514#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40515#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:06:15,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {40515#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40516#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:06:15,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {40516#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40517#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:06:15,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {40517#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40518#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:06:15,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {40518#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40519#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:06:15,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {40519#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40520#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:06:15,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {40520#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40521#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:06:15,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {40521#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40522#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:06:15,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {40522#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40523#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:06:15,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {40523#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40524#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:06:15,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {40524#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40525#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:06:15,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {40525#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40526#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:06:15,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {40526#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40527#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:06:15,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {40527#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40528#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:06:15,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {40528#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40529#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:06:15,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {40529#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40530#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:06:15,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {40530#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40531#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:06:15,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {40531#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40532#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:06:15,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {40532#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40533#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:06:15,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {40533#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40534#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:06:15,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {40534#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40535#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:06:15,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {40535#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40536#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:06:15,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {40536#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40537#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:06:15,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {40537#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40538#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:06:15,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {40538#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40539#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:06:15,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {40539#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40540#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:06:15,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {40540#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40541#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:06:15,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {40541#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40542#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:06:15,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {40542#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40543#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:06:15,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {40543#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40544#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:06:15,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {40544#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40545#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:06:15,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {40545#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40546#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:06:15,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {40546#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40547#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:06:15,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {40547#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40548#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:06:15,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {40548#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40549#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:06:15,387 INFO L290 TraceCheckUtils]: 56: Hoare triple {40549#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40550#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:06:15,387 INFO L290 TraceCheckUtils]: 57: Hoare triple {40550#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40551#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:06:15,388 INFO L290 TraceCheckUtils]: 58: Hoare triple {40551#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40552#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:06:15,388 INFO L290 TraceCheckUtils]: 59: Hoare triple {40552#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40553#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:06:15,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {40553#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40554#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:06:15,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {40554#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40555#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:06:15,390 INFO L290 TraceCheckUtils]: 62: Hoare triple {40555#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40556#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:06:15,390 INFO L290 TraceCheckUtils]: 63: Hoare triple {40556#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40557#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:06:15,391 INFO L290 TraceCheckUtils]: 64: Hoare triple {40557#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40558#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:06:15,391 INFO L290 TraceCheckUtils]: 65: Hoare triple {40558#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40559#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:06:15,392 INFO L290 TraceCheckUtils]: 66: Hoare triple {40559#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40560#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:06:15,392 INFO L290 TraceCheckUtils]: 67: Hoare triple {40560#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40767#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:06:15,392 INFO L290 TraceCheckUtils]: 68: Hoare triple {40767#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {40495#false} is VALID [2022-04-28 03:06:15,393 INFO L272 TraceCheckUtils]: 69: Hoare triple {40495#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {40495#false} is VALID [2022-04-28 03:06:15,393 INFO L290 TraceCheckUtils]: 70: Hoare triple {40495#false} ~cond := #in~cond; {40495#false} is VALID [2022-04-28 03:06:15,393 INFO L290 TraceCheckUtils]: 71: Hoare triple {40495#false} assume 0 == ~cond; {40495#false} is VALID [2022-04-28 03:06:15,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {40495#false} assume !false; {40495#false} is VALID [2022-04-28 03:06:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:15,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:21,080 INFO L290 TraceCheckUtils]: 72: Hoare triple {40495#false} assume !false; {40495#false} is VALID [2022-04-28 03:06:21,080 INFO L290 TraceCheckUtils]: 71: Hoare triple {40495#false} assume 0 == ~cond; {40495#false} is VALID [2022-04-28 03:06:21,080 INFO L290 TraceCheckUtils]: 70: Hoare triple {40495#false} ~cond := #in~cond; {40495#false} is VALID [2022-04-28 03:06:21,080 INFO L272 TraceCheckUtils]: 69: Hoare triple {40495#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {40495#false} is VALID [2022-04-28 03:06:21,081 INFO L290 TraceCheckUtils]: 68: Hoare triple {40795#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {40495#false} is VALID [2022-04-28 03:06:21,081 INFO L290 TraceCheckUtils]: 67: Hoare triple {40799#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40795#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:06:21,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {40803#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40799#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,083 INFO L290 TraceCheckUtils]: 65: Hoare triple {40807#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40803#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,083 INFO L290 TraceCheckUtils]: 64: Hoare triple {40811#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40807#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,084 INFO L290 TraceCheckUtils]: 63: Hoare triple {40815#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40811#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,085 INFO L290 TraceCheckUtils]: 62: Hoare triple {40819#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40815#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,085 INFO L290 TraceCheckUtils]: 61: Hoare triple {40823#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40819#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {40827#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40823#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {40831#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40827#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,087 INFO L290 TraceCheckUtils]: 58: Hoare triple {40835#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40831#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,087 INFO L290 TraceCheckUtils]: 57: Hoare triple {40839#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40835#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,088 INFO L290 TraceCheckUtils]: 56: Hoare triple {40843#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40839#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,089 INFO L290 TraceCheckUtils]: 55: Hoare triple {40847#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40843#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {40851#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40847#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {40855#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40851#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,091 INFO L290 TraceCheckUtils]: 52: Hoare triple {40859#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40855#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {40863#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40859#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {40867#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40863#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,093 INFO L290 TraceCheckUtils]: 49: Hoare triple {40871#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40867#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {40875#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40871#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,094 INFO L290 TraceCheckUtils]: 47: Hoare triple {40879#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40875#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,094 INFO L290 TraceCheckUtils]: 46: Hoare triple {40883#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40879#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,095 INFO L290 TraceCheckUtils]: 45: Hoare triple {40887#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40883#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {40891#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40887#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {40895#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40891#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {40899#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40895#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {40903#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40899#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {40907#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40903#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,098 INFO L290 TraceCheckUtils]: 39: Hoare triple {40911#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40907#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {40915#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40911#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {40919#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40915#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {40923#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40919#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {40927#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40923#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {40931#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40927#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {40935#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40931#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {40939#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40935#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {40943#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40939#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {40947#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40943#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {40951#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40947#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {40955#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40951#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {40959#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40955#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {40963#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40959#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {40967#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40963#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {40971#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40967#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {40975#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40971#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {40979#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40975#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {40983#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40979#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {40987#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40983#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {40991#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40987#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {40995#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40991#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {40999#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40995#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {41003#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {40999#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {41007#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41003#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {41011#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41007#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {41015#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41011#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {41019#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41015#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {41023#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41019#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {41027#(< (mod (+ main_~y~0 58) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41023#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {41031#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41027#(< (mod (+ main_~y~0 58) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {41035#(< (mod (+ main_~y~0 60) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41031#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {41039#(< (mod (+ main_~y~0 61) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41035#(< (mod (+ main_~y~0 60) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {41043#(< (mod (+ main_~y~0 62) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41039#(< (mod (+ main_~y~0 61) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {40494#true} ~x~0 := 1;~y~0 := 0; {41043#(< (mod (+ main_~y~0 62) 4294967296) 1024)} is VALID [2022-04-28 03:06:21,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {40494#true} call #t~ret5 := main(); {40494#true} is VALID [2022-04-28 03:06:21,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40494#true} {40494#true} #34#return; {40494#true} is VALID [2022-04-28 03:06:21,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {40494#true} assume true; {40494#true} is VALID [2022-04-28 03:06:21,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {40494#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(12, 2);call #Ultimate.allocInit(12, 3); {40494#true} is VALID [2022-04-28 03:06:21,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {40494#true} call ULTIMATE.init(); {40494#true} is VALID [2022-04-28 03:06:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:21,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774762071] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:21,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:21,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 130 [2022-04-28 03:06:21,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:21,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [289989642] [2022-04-28 03:06:21,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [289989642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:21,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:21,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-28 03:06:21,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918621418] [2022-04-28 03:06:21,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:21,123 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 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 73 [2022-04-28 03:06:21,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:21,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 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-28 03:06:21,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:21,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-28 03:06:21,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:21,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-28 03:06:21,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4352, Invalid=12418, Unknown=0, NotChecked=0, Total=16770 [2022-04-28 03:06:21,160 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 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-28 03:06:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:28,623 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 03:06:28,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-28 03:06:28,624 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 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 73 [2022-04-28 03:06:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 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-28 03:06:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-04-28 03:06:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 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-28 03:06:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-04-28 03:06:28,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 80 transitions. [2022-04-28 03:06:28,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:28,674 INFO L225 Difference]: With dead ends: 80 [2022-04-28 03:06:28,674 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 03:06:28,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2083 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=8697, Invalid=28359, Unknown=0, NotChecked=0, Total=37056 [2022-04-28 03:06:28,676 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4058 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 4185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 4058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:06:28,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 4185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 4058 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 03:06:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 03:06:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-28 03:06:28,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:28,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 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-28 03:06:28,770 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 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-28 03:06:28,771 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 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-28 03:06:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:28,771 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-28 03:06:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 03:06:28,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:28,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:28,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 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 75 states. [2022-04-28 03:06:28,772 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 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 75 states. [2022-04-28 03:06:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:28,772 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-28 03:06:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 03:06:28,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:28,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:28,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:28,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 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-28 03:06:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2022-04-28 03:06:28,773 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2022-04-28 03:06:28,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:28,773 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2022-04-28 03:06:28,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 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-28 03:06:28,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 75 transitions. [2022-04-28 03:06:28,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 03:06:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 03:06:28,826 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:28,826 INFO L195 NwaCegarLoop]: trace histogram [63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:28,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-28 03:06:29,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125 [2022-04-28 03:06:29,026 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:29,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2034851254, now seen corresponding path program 125 times [2022-04-28 03:06:29,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:29,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [755588808] [2022-04-28 03:06:32,637 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:06:32,772 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:06:32,773 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:06:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1797223543, now seen corresponding path program 1 times [2022-04-28 03:06:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:32,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022702782] [2022-04-28 03:06:32,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:32,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:32,779 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:06:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:32,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:06:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2034851254, now seen corresponding path program 126 times [2022-04-28 03:06:32,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:32,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860999393] [2022-04-28 03:06:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:34,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:34,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {41719#(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(12, 2);call #Ultimate.allocInit(12, 3); {41650#true} is VALID [2022-04-28 03:06:34,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {41650#true} assume true; {41650#true} is VALID [2022-04-28 03:06:34,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41650#true} {41650#true} #34#return; {41650#true} is VALID [2022-04-28 03:06:34,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {41650#true} call ULTIMATE.init(); {41719#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:06:34,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {41719#(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(12, 2);call #Ultimate.allocInit(12, 3); {41650#true} is VALID [2022-04-28 03:06:34,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {41650#true} assume true; {41650#true} is VALID [2022-04-28 03:06:34,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41650#true} {41650#true} #34#return; {41650#true} is VALID [2022-04-28 03:06:34,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {41650#true} call #t~ret5 := main(); {41650#true} is VALID [2022-04-28 03:06:34,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {41650#true} ~x~0 := 1;~y~0 := 0; {41655#(= main_~y~0 0)} is VALID [2022-04-28 03:06:34,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {41655#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41656#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:06:34,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {41656#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41657#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:06:34,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {41657#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41658#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:06:34,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {41658#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41659#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:06:34,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {41659#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41660#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:06:34,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {41660#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41661#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:06:34,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {41661#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41662#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:06:34,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {41662#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41663#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:06:34,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {41663#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41664#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:06:34,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {41664#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41665#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:06:34,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {41665#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41666#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:06:34,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {41666#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41667#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:06:34,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {41667#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41668#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:06:34,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {41668#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41669#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:06:34,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {41669#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41670#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:06:34,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {41670#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41671#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:06:34,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {41671#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41672#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:06:34,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {41672#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41673#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:06:34,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {41673#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41674#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:06:34,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {41674#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41675#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:06:34,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {41675#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41676#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:06:34,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {41676#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41677#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:06:34,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {41677#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41678#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:06:34,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {41678#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41679#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:06:34,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {41679#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41680#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:06:34,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {41680#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41681#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:06:34,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {41681#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41682#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:06:34,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {41682#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41683#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:06:34,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {41683#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41684#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:06:34,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {41684#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41685#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:06:34,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {41685#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41686#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:06:34,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {41686#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41687#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:06:34,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {41687#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41688#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:06:34,640 INFO L290 TraceCheckUtils]: 39: Hoare triple {41688#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41689#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:06:34,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {41689#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41690#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:06:34,641 INFO L290 TraceCheckUtils]: 41: Hoare triple {41690#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41691#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:06:34,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {41691#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41692#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:06:34,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {41692#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41693#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:06:34,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {41693#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41694#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:06:34,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {41694#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41695#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:06:34,643 INFO L290 TraceCheckUtils]: 46: Hoare triple {41695#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41696#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:06:34,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {41696#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41697#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:06:34,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {41697#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41698#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:06:34,645 INFO L290 TraceCheckUtils]: 49: Hoare triple {41698#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41699#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:06:34,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {41699#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41700#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:06:34,645 INFO L290 TraceCheckUtils]: 51: Hoare triple {41700#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41701#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:06:34,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {41701#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41702#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:06:34,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {41702#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41703#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:06:34,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {41703#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41704#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:06:34,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {41704#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41705#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:06:34,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {41705#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41706#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:06:34,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {41706#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41707#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:06:34,649 INFO L290 TraceCheckUtils]: 58: Hoare triple {41707#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41708#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:06:34,649 INFO L290 TraceCheckUtils]: 59: Hoare triple {41708#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41709#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:06:34,650 INFO L290 TraceCheckUtils]: 60: Hoare triple {41709#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41710#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:06:34,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {41710#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41711#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:06:34,651 INFO L290 TraceCheckUtils]: 62: Hoare triple {41711#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41712#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:06:34,651 INFO L290 TraceCheckUtils]: 63: Hoare triple {41712#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41713#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:06:34,652 INFO L290 TraceCheckUtils]: 64: Hoare triple {41713#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41714#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:06:34,652 INFO L290 TraceCheckUtils]: 65: Hoare triple {41714#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41715#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:06:34,653 INFO L290 TraceCheckUtils]: 66: Hoare triple {41715#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41716#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:06:34,653 INFO L290 TraceCheckUtils]: 67: Hoare triple {41716#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41717#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:06:34,654 INFO L290 TraceCheckUtils]: 68: Hoare triple {41717#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41718#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 63))} is VALID [2022-04-28 03:06:34,654 INFO L290 TraceCheckUtils]: 69: Hoare triple {41718#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 63))} assume !(~y~0 % 4294967296 < 1024); {41651#false} is VALID [2022-04-28 03:06:34,654 INFO L272 TraceCheckUtils]: 70: Hoare triple {41651#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {41651#false} is VALID [2022-04-28 03:06:34,654 INFO L290 TraceCheckUtils]: 71: Hoare triple {41651#false} ~cond := #in~cond; {41651#false} is VALID [2022-04-28 03:06:34,654 INFO L290 TraceCheckUtils]: 72: Hoare triple {41651#false} assume 0 == ~cond; {41651#false} is VALID [2022-04-28 03:06:34,654 INFO L290 TraceCheckUtils]: 73: Hoare triple {41651#false} assume !false; {41651#false} is VALID [2022-04-28 03:06:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:34,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:34,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860999393] [2022-04-28 03:06:34,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860999393] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:34,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318098449] [2022-04-28 03:06:34,655 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:06:34,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:34,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:34,656 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:06:34,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-28 03:07:09,402 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2022-04-28 03:07:09,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:09,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 129 conjunts are in the unsatisfiable core [2022-04-28 03:07:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:09,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:10,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {41650#true} call ULTIMATE.init(); {41650#true} is VALID [2022-04-28 03:07:10,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {41650#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(12, 2);call #Ultimate.allocInit(12, 3); {41650#true} is VALID [2022-04-28 03:07:10,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {41650#true} assume true; {41650#true} is VALID [2022-04-28 03:07:10,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41650#true} {41650#true} #34#return; {41650#true} is VALID [2022-04-28 03:07:10,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {41650#true} call #t~ret5 := main(); {41650#true} is VALID [2022-04-28 03:07:10,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {41650#true} ~x~0 := 1;~y~0 := 0; {41655#(= main_~y~0 0)} is VALID [2022-04-28 03:07:10,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {41655#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41656#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:07:10,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {41656#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41657#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:07:10,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {41657#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41658#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:07:10,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {41658#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41659#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:07:10,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {41659#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41660#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:07:10,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {41660#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41661#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:07:10,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {41661#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41662#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:07:10,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {41662#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41663#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:07:10,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {41663#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41664#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:07:10,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {41664#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41665#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:07:10,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {41665#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41666#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:07:10,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {41666#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41667#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:07:10,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {41667#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41668#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:07:10,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {41668#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41669#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:07:10,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {41669#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41670#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:07:10,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {41670#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41671#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:07:10,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {41671#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41672#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:07:10,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {41672#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41673#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:07:10,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {41673#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41674#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:07:10,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {41674#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41675#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:07:10,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {41675#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41676#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:07:10,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {41676#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41677#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:07:10,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {41677#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41678#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:07:10,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {41678#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41679#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:07:10,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {41679#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41680#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:07:10,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {41680#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41681#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:07:10,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {41681#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41682#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:07:10,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {41682#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41683#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:07:10,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {41683#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41684#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:07:10,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {41684#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41685#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:07:10,181 INFO L290 TraceCheckUtils]: 36: Hoare triple {41685#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41686#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:07:10,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {41686#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41687#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:07:10,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {41687#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41688#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:07:10,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {41688#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41689#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:07:10,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {41689#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41690#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:07:10,184 INFO L290 TraceCheckUtils]: 41: Hoare triple {41690#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41691#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:07:10,184 INFO L290 TraceCheckUtils]: 42: Hoare triple {41691#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41692#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:07:10,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {41692#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41693#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:07:10,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {41693#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41694#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:07:10,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {41694#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41695#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:07:10,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {41695#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41696#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:07:10,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {41696#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41697#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:07:10,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {41697#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41698#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:07:10,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {41698#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41699#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:07:10,188 INFO L290 TraceCheckUtils]: 50: Hoare triple {41699#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41700#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:07:10,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {41700#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41701#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:07:10,189 INFO L290 TraceCheckUtils]: 52: Hoare triple {41701#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41702#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:07:10,189 INFO L290 TraceCheckUtils]: 53: Hoare triple {41702#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41703#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:07:10,190 INFO L290 TraceCheckUtils]: 54: Hoare triple {41703#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41704#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:07:10,190 INFO L290 TraceCheckUtils]: 55: Hoare triple {41704#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41705#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:07:10,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {41705#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41706#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:07:10,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {41706#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41707#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:07:10,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {41707#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41708#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:07:10,192 INFO L290 TraceCheckUtils]: 59: Hoare triple {41708#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41709#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:07:10,193 INFO L290 TraceCheckUtils]: 60: Hoare triple {41709#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41710#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:07:10,193 INFO L290 TraceCheckUtils]: 61: Hoare triple {41710#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41711#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:07:10,194 INFO L290 TraceCheckUtils]: 62: Hoare triple {41711#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41712#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:07:10,194 INFO L290 TraceCheckUtils]: 63: Hoare triple {41712#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41713#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:07:10,194 INFO L290 TraceCheckUtils]: 64: Hoare triple {41713#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41714#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:07:10,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {41714#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41715#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:07:10,195 INFO L290 TraceCheckUtils]: 66: Hoare triple {41715#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41716#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:07:10,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {41716#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41717#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:07:10,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {41717#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41927#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-28 03:07:10,197 INFO L290 TraceCheckUtils]: 69: Hoare triple {41927#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !(~y~0 % 4294967296 < 1024); {41651#false} is VALID [2022-04-28 03:07:10,197 INFO L272 TraceCheckUtils]: 70: Hoare triple {41651#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {41651#false} is VALID [2022-04-28 03:07:10,197 INFO L290 TraceCheckUtils]: 71: Hoare triple {41651#false} ~cond := #in~cond; {41651#false} is VALID [2022-04-28 03:07:10,197 INFO L290 TraceCheckUtils]: 72: Hoare triple {41651#false} assume 0 == ~cond; {41651#false} is VALID [2022-04-28 03:07:10,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {41651#false} assume !false; {41651#false} is VALID [2022-04-28 03:07:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:10,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:16,061 INFO L290 TraceCheckUtils]: 73: Hoare triple {41651#false} assume !false; {41651#false} is VALID [2022-04-28 03:07:16,061 INFO L290 TraceCheckUtils]: 72: Hoare triple {41651#false} assume 0 == ~cond; {41651#false} is VALID [2022-04-28 03:07:16,061 INFO L290 TraceCheckUtils]: 71: Hoare triple {41651#false} ~cond := #in~cond; {41651#false} is VALID [2022-04-28 03:07:16,061 INFO L272 TraceCheckUtils]: 70: Hoare triple {41651#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {41651#false} is VALID [2022-04-28 03:07:16,061 INFO L290 TraceCheckUtils]: 69: Hoare triple {41955#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {41651#false} is VALID [2022-04-28 03:07:16,062 INFO L290 TraceCheckUtils]: 68: Hoare triple {41959#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41955#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:07:16,063 INFO L290 TraceCheckUtils]: 67: Hoare triple {41963#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41959#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {41967#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41963#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {41971#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41967#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,065 INFO L290 TraceCheckUtils]: 64: Hoare triple {41975#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41971#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {41979#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41975#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,066 INFO L290 TraceCheckUtils]: 62: Hoare triple {41983#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41979#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {41987#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41983#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,067 INFO L290 TraceCheckUtils]: 60: Hoare triple {41991#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41987#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,068 INFO L290 TraceCheckUtils]: 59: Hoare triple {41995#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41991#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {41999#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41995#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,070 INFO L290 TraceCheckUtils]: 57: Hoare triple {42003#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {41999#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,070 INFO L290 TraceCheckUtils]: 56: Hoare triple {42007#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42003#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {42011#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42007#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {42015#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42011#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,074 INFO L290 TraceCheckUtils]: 53: Hoare triple {42019#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42015#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,074 INFO L290 TraceCheckUtils]: 52: Hoare triple {42023#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42019#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {42027#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42023#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {42031#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42027#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {42035#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42031#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,077 INFO L290 TraceCheckUtils]: 48: Hoare triple {42039#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42035#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,077 INFO L290 TraceCheckUtils]: 47: Hoare triple {42043#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42039#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {42047#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42043#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {42051#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42047#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,079 INFO L290 TraceCheckUtils]: 44: Hoare triple {42055#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42051#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {42059#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42055#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {42063#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42059#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,081 INFO L290 TraceCheckUtils]: 41: Hoare triple {42067#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42063#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,081 INFO L290 TraceCheckUtils]: 40: Hoare triple {42071#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42067#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {42075#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42071#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {42079#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42075#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {42083#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42079#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {42087#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42083#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {42091#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42087#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {42095#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42091#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {42099#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42095#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {42103#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42099#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {42107#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42103#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {42111#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42107#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {42115#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42111#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {42119#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42115#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {42123#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42119#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {42127#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42123#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {42131#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42127#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {42135#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42131#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {42139#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42135#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {42143#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42139#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {42147#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42143#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {42151#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42147#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {42155#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42151#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {42159#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42155#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {42163#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42159#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {42167#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42163#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {42171#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42167#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {42175#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42171#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {42179#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42175#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {42183#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42179#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {42187#(< (mod (+ main_~y~0 58) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42183#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {42191#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42187#(< (mod (+ main_~y~0 58) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {42195#(< (mod (+ main_~y~0 60) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42191#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {42199#(< (mod (+ main_~y~0 61) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42195#(< (mod (+ main_~y~0 60) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {42203#(< (mod (+ main_~y~0 62) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42199#(< (mod (+ main_~y~0 61) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {42207#(< (mod (+ main_~y~0 63) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42203#(< (mod (+ main_~y~0 62) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {41650#true} ~x~0 := 1;~y~0 := 0; {42207#(< (mod (+ main_~y~0 63) 4294967296) 1024)} is VALID [2022-04-28 03:07:16,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {41650#true} call #t~ret5 := main(); {41650#true} is VALID [2022-04-28 03:07:16,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41650#true} {41650#true} #34#return; {41650#true} is VALID [2022-04-28 03:07:16,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {41650#true} assume true; {41650#true} is VALID [2022-04-28 03:07:16,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {41650#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(12, 2);call #Ultimate.allocInit(12, 3); {41650#true} is VALID [2022-04-28 03:07:16,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {41650#true} call ULTIMATE.init(); {41650#true} is VALID [2022-04-28 03:07:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:16,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318098449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:16,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:16,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 132 [2022-04-28 03:07:16,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:16,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [755588808] [2022-04-28 03:07:16,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [755588808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:16,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:16,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-28 03:07:16,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162389421] [2022-04-28 03:07:16,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:16,107 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 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 74 [2022-04-28 03:07:16,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:16,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 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-28 03:07:16,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:16,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-28 03:07:16,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:16,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-28 03:07:16,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4485, Invalid=12807, Unknown=0, NotChecked=0, Total=17292 [2022-04-28 03:07:16,145 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 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-28 03:07:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:23,967 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2022-04-28 03:07:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-28 03:07:23,967 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 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 74 [2022-04-28 03:07:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 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-28 03:07:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-04-28 03:07:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 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-28 03:07:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-04-28 03:07:23,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 81 transitions. [2022-04-28 03:07:24,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:24,016 INFO L225 Difference]: With dead ends: 81 [2022-04-28 03:07:24,016 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 03:07:24,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2148 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=8963, Invalid=29257, Unknown=0, NotChecked=0, Total=38220 [2022-04-28 03:07:24,018 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 4314 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 4443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 4314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:24,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 293 Invalid, 4443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 4314 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 03:07:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 03:07:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 03:07:24,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:24,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:24,096 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:24,096 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:24,097 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 03:07:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-28 03:07:24,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:24,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:24,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 03:07:24,097 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 03:07:24,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:24,098 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 03:07:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-28 03:07:24,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:24,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:24,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:24,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2022-04-28 03:07:24,099 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2022-04-28 03:07:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:24,099 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2022-04-28 03:07:24,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 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-28 03:07:24,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 76 transitions. [2022-04-28 03:07:24,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-28 03:07:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 03:07:24,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:24,152 INFO L195 NwaCegarLoop]: trace histogram [64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:24,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-04-28 03:07:24,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126,SelfDestructingSolverStorable127 [2022-04-28 03:07:24,353 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1307659300, now seen corresponding path program 127 times [2022-04-28 03:07:24,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:24,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2047123707] [2022-04-28 03:07:24,700 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:07:24,701 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:07:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1856328887, now seen corresponding path program 1 times [2022-04-28 03:07:24,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:24,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357872432] [2022-04-28 03:07:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:24,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:24,717 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:07:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:24,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:07:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1307659300, now seen corresponding path program 128 times [2022-04-28 03:07:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:24,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45107803] [2022-04-28 03:07:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:26,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {42892#(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(12, 2);call #Ultimate.allocInit(12, 3); {42822#true} is VALID [2022-04-28 03:07:26,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {42822#true} assume true; {42822#true} is VALID [2022-04-28 03:07:26,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42822#true} {42822#true} #34#return; {42822#true} is VALID [2022-04-28 03:07:26,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {42822#true} call ULTIMATE.init(); {42892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:26,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {42892#(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(12, 2);call #Ultimate.allocInit(12, 3); {42822#true} is VALID [2022-04-28 03:07:26,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {42822#true} assume true; {42822#true} is VALID [2022-04-28 03:07:26,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42822#true} {42822#true} #34#return; {42822#true} is VALID [2022-04-28 03:07:26,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {42822#true} call #t~ret5 := main(); {42822#true} is VALID [2022-04-28 03:07:26,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {42822#true} ~x~0 := 1;~y~0 := 0; {42827#(= main_~y~0 0)} is VALID [2022-04-28 03:07:26,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {42827#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:07:26,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {42828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:07:26,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {42829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:07:26,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {42830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42831#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:07:26,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {42831#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42832#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:07:26,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {42832#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42833#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:07:26,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {42833#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42834#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:07:26,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {42834#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42835#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:07:26,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {42835#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42836#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:07:26,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {42836#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42837#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:07:26,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {42837#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42838#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:07:26,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {42838#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42839#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:07:26,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {42839#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42840#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:07:26,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {42840#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42841#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:07:26,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {42841#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42842#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:07:26,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {42842#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42843#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:07:26,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {42843#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42844#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:07:26,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {42844#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42845#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:07:26,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {42845#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42846#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:07:26,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {42846#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42847#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:07:26,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {42847#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42848#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:07:26,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {42848#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42849#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:07:26,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {42849#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42850#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:07:26,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {42850#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42851#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:07:26,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {42851#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42852#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:07:26,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {42852#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42853#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:07:26,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {42853#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42854#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:07:26,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {42854#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42855#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:07:26,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {42855#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42856#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:07:26,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {42856#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42857#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:07:26,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {42857#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42858#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:07:26,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {42858#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42859#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:07:26,629 INFO L290 TraceCheckUtils]: 38: Hoare triple {42859#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42860#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:07:26,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {42860#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42861#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:07:26,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {42861#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42862#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:07:26,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {42862#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42863#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:07:26,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {42863#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42864#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:07:26,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {42864#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42865#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:07:26,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {42865#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42866#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:07:26,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {42866#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42867#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:07:26,633 INFO L290 TraceCheckUtils]: 46: Hoare triple {42867#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42868#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:07:26,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {42868#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42869#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:07:26,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {42869#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42870#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:07:26,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {42870#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42871#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:07:26,635 INFO L290 TraceCheckUtils]: 50: Hoare triple {42871#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42872#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:07:26,635 INFO L290 TraceCheckUtils]: 51: Hoare triple {42872#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42873#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:07:26,636 INFO L290 TraceCheckUtils]: 52: Hoare triple {42873#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42874#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:07:26,636 INFO L290 TraceCheckUtils]: 53: Hoare triple {42874#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42875#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:07:26,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {42875#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42876#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:07:26,637 INFO L290 TraceCheckUtils]: 55: Hoare triple {42876#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42877#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:07:26,638 INFO L290 TraceCheckUtils]: 56: Hoare triple {42877#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42878#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:07:26,638 INFO L290 TraceCheckUtils]: 57: Hoare triple {42878#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42879#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:07:26,639 INFO L290 TraceCheckUtils]: 58: Hoare triple {42879#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42880#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:07:26,639 INFO L290 TraceCheckUtils]: 59: Hoare triple {42880#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42881#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:07:26,640 INFO L290 TraceCheckUtils]: 60: Hoare triple {42881#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42882#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:07:26,640 INFO L290 TraceCheckUtils]: 61: Hoare triple {42882#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42883#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:07:26,641 INFO L290 TraceCheckUtils]: 62: Hoare triple {42883#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42884#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:07:26,641 INFO L290 TraceCheckUtils]: 63: Hoare triple {42884#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42885#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:07:26,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {42885#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42886#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:07:26,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {42886#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42887#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:07:26,643 INFO L290 TraceCheckUtils]: 66: Hoare triple {42887#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42888#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:07:26,643 INFO L290 TraceCheckUtils]: 67: Hoare triple {42888#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42889#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:07:26,643 INFO L290 TraceCheckUtils]: 68: Hoare triple {42889#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42890#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-28 03:07:26,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {42890#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42891#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 64))} is VALID [2022-04-28 03:07:26,644 INFO L290 TraceCheckUtils]: 70: Hoare triple {42891#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 64))} assume !(~y~0 % 4294967296 < 1024); {42823#false} is VALID [2022-04-28 03:07:26,644 INFO L272 TraceCheckUtils]: 71: Hoare triple {42823#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {42823#false} is VALID [2022-04-28 03:07:26,645 INFO L290 TraceCheckUtils]: 72: Hoare triple {42823#false} ~cond := #in~cond; {42823#false} is VALID [2022-04-28 03:07:26,645 INFO L290 TraceCheckUtils]: 73: Hoare triple {42823#false} assume 0 == ~cond; {42823#false} is VALID [2022-04-28 03:07:26,645 INFO L290 TraceCheckUtils]: 74: Hoare triple {42823#false} assume !false; {42823#false} is VALID [2022-04-28 03:07:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:26,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:26,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45107803] [2022-04-28 03:07:26,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45107803] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:26,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24443741] [2022-04-28 03:07:26,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:07:26,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:26,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:26,646 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:07:26,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-28 03:07:26,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:07:26,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:26,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 131 conjunts are in the unsatisfiable core [2022-04-28 03:07:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:26,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:27,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {42822#true} call ULTIMATE.init(); {42822#true} is VALID [2022-04-28 03:07:27,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {42822#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(12, 2);call #Ultimate.allocInit(12, 3); {42822#true} is VALID [2022-04-28 03:07:27,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {42822#true} assume true; {42822#true} is VALID [2022-04-28 03:07:27,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42822#true} {42822#true} #34#return; {42822#true} is VALID [2022-04-28 03:07:27,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {42822#true} call #t~ret5 := main(); {42822#true} is VALID [2022-04-28 03:07:27,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {42822#true} ~x~0 := 1;~y~0 := 0; {42827#(= main_~y~0 0)} is VALID [2022-04-28 03:07:27,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {42827#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:07:27,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {42828#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:07:27,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {42829#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:07:27,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {42830#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42831#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:07:27,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {42831#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42832#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:07:27,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {42832#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42833#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:07:27,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {42833#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42834#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:07:27,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {42834#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42835#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:07:27,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {42835#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42836#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:07:27,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {42836#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42837#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:07:27,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {42837#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42838#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:07:27,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {42838#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42839#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:07:27,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {42839#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42840#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:07:27,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {42840#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42841#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:07:27,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {42841#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42842#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:07:27,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {42842#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42843#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:07:27,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {42843#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42844#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:07:27,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {42844#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42845#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:07:27,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {42845#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42846#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:07:27,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {42846#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42847#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:07:27,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {42847#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42848#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:07:27,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {42848#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42849#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:07:27,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {42849#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42850#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:07:27,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {42850#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42851#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:07:27,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {42851#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42852#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:07:27,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {42852#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42853#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:07:27,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {42853#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42854#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:07:27,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {42854#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42855#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:07:27,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {42855#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42856#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:07:27,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {42856#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42857#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:07:27,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {42857#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42858#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:07:27,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {42858#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42859#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:07:27,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {42859#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42860#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:07:27,533 INFO L290 TraceCheckUtils]: 39: Hoare triple {42860#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42861#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:07:27,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {42861#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42862#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:07:27,534 INFO L290 TraceCheckUtils]: 41: Hoare triple {42862#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42863#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:07:27,534 INFO L290 TraceCheckUtils]: 42: Hoare triple {42863#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42864#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:07:27,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {42864#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42865#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:07:27,536 INFO L290 TraceCheckUtils]: 44: Hoare triple {42865#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42866#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:07:27,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {42866#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42867#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:07:27,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {42867#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42868#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:07:27,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {42868#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42869#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:07:27,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {42869#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42870#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:07:27,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {42870#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42871#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:07:27,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {42871#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42872#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:07:27,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {42872#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42873#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:07:27,540 INFO L290 TraceCheckUtils]: 52: Hoare triple {42873#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42874#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:07:27,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {42874#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42875#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:07:27,541 INFO L290 TraceCheckUtils]: 54: Hoare triple {42875#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42876#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:07:27,541 INFO L290 TraceCheckUtils]: 55: Hoare triple {42876#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42877#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:07:27,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {42877#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42878#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:07:27,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {42878#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42879#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:07:27,543 INFO L290 TraceCheckUtils]: 58: Hoare triple {42879#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42880#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:07:27,543 INFO L290 TraceCheckUtils]: 59: Hoare triple {42880#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42881#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:07:27,544 INFO L290 TraceCheckUtils]: 60: Hoare triple {42881#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42882#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:07:27,544 INFO L290 TraceCheckUtils]: 61: Hoare triple {42882#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42883#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:07:27,545 INFO L290 TraceCheckUtils]: 62: Hoare triple {42883#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42884#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:07:27,545 INFO L290 TraceCheckUtils]: 63: Hoare triple {42884#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42885#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:07:27,546 INFO L290 TraceCheckUtils]: 64: Hoare triple {42885#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42886#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:07:27,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {42886#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42887#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:07:27,547 INFO L290 TraceCheckUtils]: 66: Hoare triple {42887#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42888#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:07:27,547 INFO L290 TraceCheckUtils]: 67: Hoare triple {42888#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42889#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:07:27,547 INFO L290 TraceCheckUtils]: 68: Hoare triple {42889#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {42890#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-28 03:07:27,548 INFO L290 TraceCheckUtils]: 69: Hoare triple {42890#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43103#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-28 03:07:27,548 INFO L290 TraceCheckUtils]: 70: Hoare triple {43103#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !(~y~0 % 4294967296 < 1024); {42823#false} is VALID [2022-04-28 03:07:27,549 INFO L272 TraceCheckUtils]: 71: Hoare triple {42823#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {42823#false} is VALID [2022-04-28 03:07:27,549 INFO L290 TraceCheckUtils]: 72: Hoare triple {42823#false} ~cond := #in~cond; {42823#false} is VALID [2022-04-28 03:07:27,549 INFO L290 TraceCheckUtils]: 73: Hoare triple {42823#false} assume 0 == ~cond; {42823#false} is VALID [2022-04-28 03:07:27,549 INFO L290 TraceCheckUtils]: 74: Hoare triple {42823#false} assume !false; {42823#false} is VALID [2022-04-28 03:07:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:27,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:33,605 INFO L290 TraceCheckUtils]: 74: Hoare triple {42823#false} assume !false; {42823#false} is VALID [2022-04-28 03:07:33,605 INFO L290 TraceCheckUtils]: 73: Hoare triple {42823#false} assume 0 == ~cond; {42823#false} is VALID [2022-04-28 03:07:33,605 INFO L290 TraceCheckUtils]: 72: Hoare triple {42823#false} ~cond := #in~cond; {42823#false} is VALID [2022-04-28 03:07:33,606 INFO L272 TraceCheckUtils]: 71: Hoare triple {42823#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {42823#false} is VALID [2022-04-28 03:07:33,606 INFO L290 TraceCheckUtils]: 70: Hoare triple {43131#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {42823#false} is VALID [2022-04-28 03:07:33,607 INFO L290 TraceCheckUtils]: 69: Hoare triple {43135#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43131#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:07:33,607 INFO L290 TraceCheckUtils]: 68: Hoare triple {43139#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43135#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,608 INFO L290 TraceCheckUtils]: 67: Hoare triple {43143#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43139#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,608 INFO L290 TraceCheckUtils]: 66: Hoare triple {43147#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43143#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,609 INFO L290 TraceCheckUtils]: 65: Hoare triple {43151#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43147#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,610 INFO L290 TraceCheckUtils]: 64: Hoare triple {43155#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43151#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,612 INFO L290 TraceCheckUtils]: 63: Hoare triple {43159#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43155#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,613 INFO L290 TraceCheckUtils]: 62: Hoare triple {43163#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43159#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,613 INFO L290 TraceCheckUtils]: 61: Hoare triple {43167#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43163#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,614 INFO L290 TraceCheckUtils]: 60: Hoare triple {43171#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43167#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,614 INFO L290 TraceCheckUtils]: 59: Hoare triple {43175#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43171#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,615 INFO L290 TraceCheckUtils]: 58: Hoare triple {43179#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43175#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,616 INFO L290 TraceCheckUtils]: 57: Hoare triple {43183#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43179#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,616 INFO L290 TraceCheckUtils]: 56: Hoare triple {43187#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43183#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {43191#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43187#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {43195#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43191#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {43199#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43195#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,621 INFO L290 TraceCheckUtils]: 52: Hoare triple {43203#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43199#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {43207#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43203#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {43211#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43207#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,623 INFO L290 TraceCheckUtils]: 49: Hoare triple {43215#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43211#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {43219#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43215#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {43223#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43219#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,625 INFO L290 TraceCheckUtils]: 46: Hoare triple {43227#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43223#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {43231#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43227#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {43235#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43231#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,627 INFO L290 TraceCheckUtils]: 43: Hoare triple {43239#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43235#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {43243#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43239#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,628 INFO L290 TraceCheckUtils]: 41: Hoare triple {43247#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43243#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {43251#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43247#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {43255#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43251#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {43259#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43255#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {43263#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43259#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {43267#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43263#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {43271#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43267#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {43275#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43271#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {43279#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43275#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {43283#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43279#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {43287#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43283#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {43291#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43287#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {43295#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43291#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {43299#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43295#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {43303#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43299#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {43307#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43303#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {43311#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43307#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {43315#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43311#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {43319#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43315#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {43323#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43319#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {43327#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43323#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {43331#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43327#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {43335#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43331#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {43339#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43335#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {43343#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43339#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {43347#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43343#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {43351#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43347#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {43355#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43351#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {43359#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43355#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {43363#(< (mod (+ main_~y~0 58) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43359#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {43367#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43363#(< (mod (+ main_~y~0 58) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {43371#(< (mod (+ main_~y~0 60) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43367#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {43375#(< (mod (+ main_~y~0 61) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43371#(< (mod (+ main_~y~0 60) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {43379#(< (mod (+ main_~y~0 62) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43375#(< (mod (+ main_~y~0 61) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {43383#(< (mod (+ main_~y~0 63) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43379#(< (mod (+ main_~y~0 62) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {43387#(< (mod (+ 64 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {43383#(< (mod (+ main_~y~0 63) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {42822#true} ~x~0 := 1;~y~0 := 0; {43387#(< (mod (+ 64 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:33,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {42822#true} call #t~ret5 := main(); {42822#true} is VALID [2022-04-28 03:07:33,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42822#true} {42822#true} #34#return; {42822#true} is VALID [2022-04-28 03:07:33,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {42822#true} assume true; {42822#true} is VALID [2022-04-28 03:07:33,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {42822#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(12, 2);call #Ultimate.allocInit(12, 3); {42822#true} is VALID [2022-04-28 03:07:33,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {42822#true} call ULTIMATE.init(); {42822#true} is VALID [2022-04-28 03:07:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:33,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24443741] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:33,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:33,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67, 67] total 134 [2022-04-28 03:07:33,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:33,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2047123707] [2022-04-28 03:07:33,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2047123707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:33,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:33,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-28 03:07:33,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331781965] [2022-04-28 03:07:33,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:33,654 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 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 75 [2022-04-28 03:07:33,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:33,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 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-28 03:07:33,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:33,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-28 03:07:33,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:33,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-28 03:07:33,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4620, Invalid=13202, Unknown=0, NotChecked=0, Total=17822 [2022-04-28 03:07:33,692 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 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-28 03:07:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:41,628 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-28 03:07:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-28 03:07:41,628 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 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 75 [2022-04-28 03:07:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 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-28 03:07:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2022-04-28 03:07:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 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-28 03:07:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2022-04-28 03:07:41,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 82 transitions. [2022-04-28 03:07:41,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:41,676 INFO L225 Difference]: With dead ends: 82 [2022-04-28 03:07:41,676 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 03:07:41,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2214 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=9233, Invalid=30169, Unknown=0, NotChecked=0, Total=39402 [2022-04-28 03:07:41,678 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 4422 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 4553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 4422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:41,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 273 Invalid, 4553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 4422 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 03:07:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 03:07:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-28 03:07:41,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:41,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 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-28 03:07:41,754 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 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-28 03:07:41,754 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 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-28 03:07:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:41,754 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-28 03:07:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-28 03:07:41,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:41,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:41,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 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-28 03:07:41,755 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 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-28 03:07:41,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:41,755 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-28 03:07:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-28 03:07:41,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:41,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:41,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:41,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 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-28 03:07:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-04-28 03:07:41,756 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2022-04-28 03:07:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:41,756 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-04-28 03:07:41,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 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-28 03:07:41,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 77 transitions. [2022-04-28 03:07:41,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-28 03:07:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 03:07:41,810 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:41,810 INFO L195 NwaCegarLoop]: trace histogram [65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:41,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-28 03:07:42,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:42,019 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:42,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:42,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1846271370, now seen corresponding path program 129 times [2022-04-28 03:07:42,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:42,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755802090] [2022-04-28 03:07:43,342 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:07:43,344 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:07:43,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1915434231, now seen corresponding path program 1 times [2022-04-28 03:07:43,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:43,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499458676] [2022-04-28 03:07:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:43,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:43,349 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:07:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:43,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:07:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1846271370, now seen corresponding path program 130 times [2022-04-28 03:07:43,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:43,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843555255] [2022-04-28 03:07:43,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:43,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:45,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:45,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {44081#(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(12, 2);call #Ultimate.allocInit(12, 3); {44010#true} is VALID [2022-04-28 03:07:45,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {44010#true} assume true; {44010#true} is VALID [2022-04-28 03:07:45,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44010#true} {44010#true} #34#return; {44010#true} is VALID [2022-04-28 03:07:45,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {44010#true} call ULTIMATE.init(); {44081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:45,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {44081#(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(12, 2);call #Ultimate.allocInit(12, 3); {44010#true} is VALID [2022-04-28 03:07:45,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {44010#true} assume true; {44010#true} is VALID [2022-04-28 03:07:45,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44010#true} {44010#true} #34#return; {44010#true} is VALID [2022-04-28 03:07:45,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {44010#true} call #t~ret5 := main(); {44010#true} is VALID [2022-04-28 03:07:45,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {44010#true} ~x~0 := 1;~y~0 := 0; {44015#(= main_~y~0 0)} is VALID [2022-04-28 03:07:45,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {44015#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44016#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:07:45,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {44016#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44017#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:07:45,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {44017#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44018#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:07:45,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {44018#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44019#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:07:45,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {44019#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44020#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:07:45,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {44020#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44021#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:07:45,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {44021#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44022#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:07:45,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {44022#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44023#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:07:45,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {44023#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44024#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:07:45,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {44024#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44025#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:07:45,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {44025#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44026#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:07:45,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {44026#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44027#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:07:45,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {44027#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44028#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:07:45,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {44028#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44029#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:07:45,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {44029#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44030#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:07:45,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {44030#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44031#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:07:45,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {44031#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44032#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:07:45,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {44032#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44033#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:07:45,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {44033#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44034#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:07:45,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {44034#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44035#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:07:45,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {44035#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44036#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:07:45,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {44036#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44037#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:07:45,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {44037#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44038#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:07:45,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {44038#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44039#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:07:45,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {44039#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44040#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:07:45,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {44040#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44041#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:07:45,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {44041#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44042#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:07:45,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {44042#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44043#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:07:45,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {44043#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44044#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:07:45,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {44044#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44045#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:07:45,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {44045#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44046#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:07:45,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {44046#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44047#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:07:45,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {44047#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44048#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:07:45,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {44048#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44049#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:07:45,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {44049#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44050#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:07:45,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {44050#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44051#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:07:45,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {44051#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44052#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:07:45,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {44052#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44053#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:07:45,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {44053#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44054#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:07:45,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {44054#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44055#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:07:45,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {44055#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44056#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:07:45,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {44056#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44057#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:07:45,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {44057#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44058#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:07:45,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {44058#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44059#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:07:45,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {44059#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44060#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:07:45,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {44060#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44061#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:07:45,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {44061#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44062#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:07:45,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {44062#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44063#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:07:45,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {44063#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44064#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:07:45,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {44064#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44065#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:07:45,307 INFO L290 TraceCheckUtils]: 56: Hoare triple {44065#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44066#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:07:45,307 INFO L290 TraceCheckUtils]: 57: Hoare triple {44066#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44067#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:07:45,308 INFO L290 TraceCheckUtils]: 58: Hoare triple {44067#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44068#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:07:45,308 INFO L290 TraceCheckUtils]: 59: Hoare triple {44068#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44069#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:07:45,309 INFO L290 TraceCheckUtils]: 60: Hoare triple {44069#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44070#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:07:45,309 INFO L290 TraceCheckUtils]: 61: Hoare triple {44070#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44071#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:07:45,310 INFO L290 TraceCheckUtils]: 62: Hoare triple {44071#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44072#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:07:45,310 INFO L290 TraceCheckUtils]: 63: Hoare triple {44072#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44073#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:07:45,310 INFO L290 TraceCheckUtils]: 64: Hoare triple {44073#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44074#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:07:45,311 INFO L290 TraceCheckUtils]: 65: Hoare triple {44074#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44075#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:07:45,311 INFO L290 TraceCheckUtils]: 66: Hoare triple {44075#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44076#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:07:45,312 INFO L290 TraceCheckUtils]: 67: Hoare triple {44076#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44077#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:07:45,312 INFO L290 TraceCheckUtils]: 68: Hoare triple {44077#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44078#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-28 03:07:45,313 INFO L290 TraceCheckUtils]: 69: Hoare triple {44078#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44079#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-28 03:07:45,313 INFO L290 TraceCheckUtils]: 70: Hoare triple {44079#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44080#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 65))} is VALID [2022-04-28 03:07:45,314 INFO L290 TraceCheckUtils]: 71: Hoare triple {44080#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 65))} assume !(~y~0 % 4294967296 < 1024); {44011#false} is VALID [2022-04-28 03:07:45,314 INFO L272 TraceCheckUtils]: 72: Hoare triple {44011#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {44011#false} is VALID [2022-04-28 03:07:45,314 INFO L290 TraceCheckUtils]: 73: Hoare triple {44011#false} ~cond := #in~cond; {44011#false} is VALID [2022-04-28 03:07:45,314 INFO L290 TraceCheckUtils]: 74: Hoare triple {44011#false} assume 0 == ~cond; {44011#false} is VALID [2022-04-28 03:07:45,314 INFO L290 TraceCheckUtils]: 75: Hoare triple {44011#false} assume !false; {44011#false} is VALID [2022-04-28 03:07:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:45,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843555255] [2022-04-28 03:07:45,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843555255] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:45,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741483120] [2022-04-28 03:07:45,315 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:07:45,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:45,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:45,316 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:07:45,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-28 03:07:45,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:07:45,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:45,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 133 conjunts are in the unsatisfiable core [2022-04-28 03:07:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:45,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:46,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {44010#true} call ULTIMATE.init(); {44010#true} is VALID [2022-04-28 03:07:46,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {44010#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(12, 2);call #Ultimate.allocInit(12, 3); {44010#true} is VALID [2022-04-28 03:07:46,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {44010#true} assume true; {44010#true} is VALID [2022-04-28 03:07:46,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44010#true} {44010#true} #34#return; {44010#true} is VALID [2022-04-28 03:07:46,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {44010#true} call #t~ret5 := main(); {44010#true} is VALID [2022-04-28 03:07:46,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {44010#true} ~x~0 := 1;~y~0 := 0; {44015#(= main_~y~0 0)} is VALID [2022-04-28 03:07:46,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {44015#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44016#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:07:46,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {44016#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44017#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:07:46,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {44017#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44018#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:07:46,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {44018#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44019#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:07:46,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {44019#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44020#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:07:46,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {44020#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44021#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:07:46,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {44021#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44022#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:07:46,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {44022#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44023#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:07:46,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {44023#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44024#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:07:46,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {44024#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44025#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:07:46,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {44025#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44026#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:07:46,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {44026#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44027#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:07:46,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {44027#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44028#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:07:46,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {44028#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44029#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:07:46,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {44029#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44030#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:07:46,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {44030#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44031#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:07:46,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {44031#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44032#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:07:46,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {44032#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44033#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:07:46,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {44033#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44034#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:07:46,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {44034#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44035#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:07:46,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {44035#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44036#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:07:46,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {44036#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44037#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:07:46,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {44037#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44038#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:07:46,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {44038#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44039#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:07:46,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {44039#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44040#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:07:46,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {44040#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44041#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:07:46,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {44041#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44042#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:07:46,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {44042#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44043#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:07:46,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {44043#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44044#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:07:46,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {44044#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44045#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:07:46,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {44045#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44046#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:07:46,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {44046#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44047#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:07:46,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {44047#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44048#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:07:46,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {44048#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44049#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:07:46,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {44049#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44050#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:07:46,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {44050#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44051#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:07:46,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {44051#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44052#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:07:46,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {44052#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44053#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:07:46,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {44053#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44054#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:07:46,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {44054#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44055#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:07:46,474 INFO L290 TraceCheckUtils]: 46: Hoare triple {44055#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44056#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:07:46,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {44056#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44057#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:07:46,475 INFO L290 TraceCheckUtils]: 48: Hoare triple {44057#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44058#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:07:46,475 INFO L290 TraceCheckUtils]: 49: Hoare triple {44058#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44059#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:07:46,476 INFO L290 TraceCheckUtils]: 50: Hoare triple {44059#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44060#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:07:46,476 INFO L290 TraceCheckUtils]: 51: Hoare triple {44060#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44061#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:07:46,477 INFO L290 TraceCheckUtils]: 52: Hoare triple {44061#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44062#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:07:46,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {44062#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44063#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:07:46,478 INFO L290 TraceCheckUtils]: 54: Hoare triple {44063#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44064#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:07:46,478 INFO L290 TraceCheckUtils]: 55: Hoare triple {44064#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44065#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:07:46,479 INFO L290 TraceCheckUtils]: 56: Hoare triple {44065#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44066#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:07:46,479 INFO L290 TraceCheckUtils]: 57: Hoare triple {44066#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44067#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:07:46,480 INFO L290 TraceCheckUtils]: 58: Hoare triple {44067#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44068#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:07:46,480 INFO L290 TraceCheckUtils]: 59: Hoare triple {44068#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44069#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:07:46,480 INFO L290 TraceCheckUtils]: 60: Hoare triple {44069#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44070#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:07:46,481 INFO L290 TraceCheckUtils]: 61: Hoare triple {44070#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44071#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:07:46,481 INFO L290 TraceCheckUtils]: 62: Hoare triple {44071#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44072#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:07:46,482 INFO L290 TraceCheckUtils]: 63: Hoare triple {44072#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44073#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:07:46,482 INFO L290 TraceCheckUtils]: 64: Hoare triple {44073#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44074#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:07:46,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {44074#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44075#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:07:46,483 INFO L290 TraceCheckUtils]: 66: Hoare triple {44075#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44076#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:07:46,484 INFO L290 TraceCheckUtils]: 67: Hoare triple {44076#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44077#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:07:46,484 INFO L290 TraceCheckUtils]: 68: Hoare triple {44077#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44078#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-28 03:07:46,485 INFO L290 TraceCheckUtils]: 69: Hoare triple {44078#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44079#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-28 03:07:46,485 INFO L290 TraceCheckUtils]: 70: Hoare triple {44079#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44295#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-28 03:07:46,486 INFO L290 TraceCheckUtils]: 71: Hoare triple {44295#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !(~y~0 % 4294967296 < 1024); {44011#false} is VALID [2022-04-28 03:07:46,486 INFO L272 TraceCheckUtils]: 72: Hoare triple {44011#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {44011#false} is VALID [2022-04-28 03:07:46,486 INFO L290 TraceCheckUtils]: 73: Hoare triple {44011#false} ~cond := #in~cond; {44011#false} is VALID [2022-04-28 03:07:46,486 INFO L290 TraceCheckUtils]: 74: Hoare triple {44011#false} assume 0 == ~cond; {44011#false} is VALID [2022-04-28 03:07:46,486 INFO L290 TraceCheckUtils]: 75: Hoare triple {44011#false} assume !false; {44011#false} is VALID [2022-04-28 03:07:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:46,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:52,566 INFO L290 TraceCheckUtils]: 75: Hoare triple {44011#false} assume !false; {44011#false} is VALID [2022-04-28 03:07:52,566 INFO L290 TraceCheckUtils]: 74: Hoare triple {44011#false} assume 0 == ~cond; {44011#false} is VALID [2022-04-28 03:07:52,566 INFO L290 TraceCheckUtils]: 73: Hoare triple {44011#false} ~cond := #in~cond; {44011#false} is VALID [2022-04-28 03:07:52,566 INFO L272 TraceCheckUtils]: 72: Hoare triple {44011#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {44011#false} is VALID [2022-04-28 03:07:52,566 INFO L290 TraceCheckUtils]: 71: Hoare triple {44323#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {44011#false} is VALID [2022-04-28 03:07:52,567 INFO L290 TraceCheckUtils]: 70: Hoare triple {44327#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44323#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:07:52,567 INFO L290 TraceCheckUtils]: 69: Hoare triple {44331#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44327#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {44335#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44331#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,569 INFO L290 TraceCheckUtils]: 67: Hoare triple {44339#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44335#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,569 INFO L290 TraceCheckUtils]: 66: Hoare triple {44343#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44339#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,570 INFO L290 TraceCheckUtils]: 65: Hoare triple {44347#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44343#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,570 INFO L290 TraceCheckUtils]: 64: Hoare triple {44351#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44347#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,571 INFO L290 TraceCheckUtils]: 63: Hoare triple {44355#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44351#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,571 INFO L290 TraceCheckUtils]: 62: Hoare triple {44359#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44355#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {44363#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44359#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,573 INFO L290 TraceCheckUtils]: 60: Hoare triple {44367#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44363#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,573 INFO L290 TraceCheckUtils]: 59: Hoare triple {44371#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44367#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,575 INFO L290 TraceCheckUtils]: 58: Hoare triple {44375#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44371#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {44379#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44375#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {44383#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44379#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {44387#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44383#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,578 INFO L290 TraceCheckUtils]: 54: Hoare triple {44391#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44387#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,578 INFO L290 TraceCheckUtils]: 53: Hoare triple {44395#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44391#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,579 INFO L290 TraceCheckUtils]: 52: Hoare triple {44399#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44395#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,579 INFO L290 TraceCheckUtils]: 51: Hoare triple {44403#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44399#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {44407#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44403#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {44411#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44407#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {44415#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44411#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,582 INFO L290 TraceCheckUtils]: 47: Hoare triple {44419#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44415#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,582 INFO L290 TraceCheckUtils]: 46: Hoare triple {44423#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44419#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {44427#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44423#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {44431#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44427#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {44435#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44431#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {44439#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44435#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {44443#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44439#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {44447#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44443#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {44451#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44447#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {44455#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44451#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {44459#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44455#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {44463#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44459#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {44467#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44463#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {44471#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44467#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {44475#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44471#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {44479#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44475#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {44483#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44479#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {44487#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44483#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {44491#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44487#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {44495#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44491#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {44499#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44495#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {44503#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44499#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {44507#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44503#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {44511#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44507#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {44515#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44511#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {44519#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44515#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {44523#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44519#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {44527#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44523#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {44531#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44527#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {44535#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44531#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {44539#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44535#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {44543#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44539#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {44547#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44543#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {44551#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44547#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {44555#(< (mod (+ main_~y~0 58) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44551#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {44559#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44555#(< (mod (+ main_~y~0 58) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {44563#(< (mod (+ main_~y~0 60) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44559#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {44567#(< (mod (+ main_~y~0 61) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44563#(< (mod (+ main_~y~0 60) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {44571#(< (mod (+ main_~y~0 62) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44567#(< (mod (+ main_~y~0 61) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {44575#(< (mod (+ main_~y~0 63) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44571#(< (mod (+ main_~y~0 62) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {44579#(< (mod (+ 64 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44575#(< (mod (+ main_~y~0 63) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {44583#(< (mod (+ main_~y~0 65) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {44579#(< (mod (+ 64 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {44010#true} ~x~0 := 1;~y~0 := 0; {44583#(< (mod (+ main_~y~0 65) 4294967296) 1024)} is VALID [2022-04-28 03:07:52,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {44010#true} call #t~ret5 := main(); {44010#true} is VALID [2022-04-28 03:07:52,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44010#true} {44010#true} #34#return; {44010#true} is VALID [2022-04-28 03:07:52,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {44010#true} assume true; {44010#true} is VALID [2022-04-28 03:07:52,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {44010#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(12, 2);call #Ultimate.allocInit(12, 3); {44010#true} is VALID [2022-04-28 03:07:52,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {44010#true} call ULTIMATE.init(); {44010#true} is VALID [2022-04-28 03:07:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:52,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741483120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:52,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:52,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 68, 68] total 136 [2022-04-28 03:07:52,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:52,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755802090] [2022-04-28 03:07:52,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755802090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:52,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:52,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-28 03:07:52,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737277040] [2022-04-28 03:07:52,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:52,613 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 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 76 [2022-04-28 03:07:52,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:52,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 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-28 03:07:52,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:52,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-28 03:07:52,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:52,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-28 03:07:52,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4757, Invalid=13603, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 03:07:52,651 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 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-28 03:08:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:00,580 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2022-04-28 03:08:00,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-28 03:08:00,580 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 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 76 [2022-04-28 03:08:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 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-28 03:08:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2022-04-28 03:08:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 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-28 03:08:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2022-04-28 03:08:00,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 83 transitions. [2022-04-28 03:08:00,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:00,646 INFO L225 Difference]: With dead ends: 83 [2022-04-28 03:08:00,646 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 03:08:00,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=9507, Invalid=31095, Unknown=0, NotChecked=0, Total=40602 [2022-04-28 03:08:00,649 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4432 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 4565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 4432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:00,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 4565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 4432 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 03:08:00,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 03:08:00,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 03:08:00,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:00,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 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-28 03:08:00,733 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 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-28 03:08:00,733 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 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-28 03:08:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:00,734 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 03:08:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-28 03:08:00,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:00,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:00,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 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 78 states. [2022-04-28 03:08:00,734 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 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 78 states. [2022-04-28 03:08:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:00,735 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 03:08:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-28 03:08:00,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:00,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:00,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:00,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 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-28 03:08:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2022-04-28 03:08:00,736 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2022-04-28 03:08:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:00,736 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2022-04-28 03:08:00,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 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-28 03:08:00,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 78 transitions. [2022-04-28 03:08:00,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-28 03:08:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 03:08:00,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:00,812 INFO L195 NwaCegarLoop]: trace histogram [66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:00,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-04-28 03:08:01,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable131 [2022-04-28 03:08:01,013 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:01,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1363376356, now seen corresponding path program 131 times [2022-04-28 03:08:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:01,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [810025024] [2022-04-28 03:08:01,240 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:08:01,241 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:08:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1974539575, now seen corresponding path program 1 times [2022-04-28 03:08:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:01,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292690494] [2022-04-28 03:08:01,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:01,246 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:08:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:01,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:08:01,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1363376356, now seen corresponding path program 132 times [2022-04-28 03:08:01,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:01,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632443129] [2022-04-28 03:08:01,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:01,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:03,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {45286#(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(12, 2);call #Ultimate.allocInit(12, 3); {45214#true} is VALID [2022-04-28 03:08:03,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {45214#true} assume true; {45214#true} is VALID [2022-04-28 03:08:03,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45214#true} {45214#true} #34#return; {45214#true} is VALID [2022-04-28 03:08:03,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {45214#true} call ULTIMATE.init(); {45286#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:03,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {45286#(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(12, 2);call #Ultimate.allocInit(12, 3); {45214#true} is VALID [2022-04-28 03:08:03,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {45214#true} assume true; {45214#true} is VALID [2022-04-28 03:08:03,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45214#true} {45214#true} #34#return; {45214#true} is VALID [2022-04-28 03:08:03,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {45214#true} call #t~ret5 := main(); {45214#true} is VALID [2022-04-28 03:08:03,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {45214#true} ~x~0 := 1;~y~0 := 0; {45219#(= main_~y~0 0)} is VALID [2022-04-28 03:08:03,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {45219#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45220#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:08:03,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {45220#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45221#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:08:03,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {45221#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45222#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:08:03,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {45222#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45223#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:08:03,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {45223#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45224#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:08:03,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {45224#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45225#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:08:03,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {45225#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45226#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:08:03,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {45226#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45227#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:08:03,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {45227#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45228#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:08:03,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {45228#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45229#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:08:03,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {45229#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45230#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:08:03,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {45230#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45231#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:08:03,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {45231#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45232#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:08:03,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {45232#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45233#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:08:03,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {45233#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45234#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:08:03,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {45234#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45235#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:08:03,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {45235#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45236#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:08:03,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {45236#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45237#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:08:03,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {45237#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45238#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:08:03,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {45238#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45239#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:08:03,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {45239#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45240#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:08:03,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {45240#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45241#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:08:03,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {45241#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45242#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:08:03,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {45242#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45243#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:08:03,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {45243#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45244#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:08:03,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {45244#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45245#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:08:03,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {45245#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45246#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:08:03,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {45246#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45247#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:08:03,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {45247#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45248#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:08:03,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {45248#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45249#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:08:03,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {45249#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45250#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:08:03,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {45250#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45251#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:08:03,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {45251#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45252#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:08:03,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {45252#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45253#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:08:03,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {45253#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45254#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:08:03,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {45254#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45255#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:08:03,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {45255#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45256#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:08:03,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {45256#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45257#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:08:03,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {45257#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45258#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:08:03,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {45258#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45259#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:08:03,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {45259#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45260#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:08:03,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {45260#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45261#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:08:03,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {45261#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45262#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:08:03,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {45262#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45263#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:08:03,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {45263#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45264#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:08:03,213 INFO L290 TraceCheckUtils]: 51: Hoare triple {45264#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45265#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:08:03,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {45265#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45266#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:08:03,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {45266#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45267#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:08:03,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {45267#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45268#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:08:03,215 INFO L290 TraceCheckUtils]: 55: Hoare triple {45268#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45269#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:08:03,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {45269#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45270#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:08:03,216 INFO L290 TraceCheckUtils]: 57: Hoare triple {45270#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45271#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:08:03,216 INFO L290 TraceCheckUtils]: 58: Hoare triple {45271#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45272#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:08:03,216 INFO L290 TraceCheckUtils]: 59: Hoare triple {45272#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45273#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:08:03,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {45273#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45274#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:08:03,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {45274#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45275#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:08:03,218 INFO L290 TraceCheckUtils]: 62: Hoare triple {45275#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45276#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:08:03,218 INFO L290 TraceCheckUtils]: 63: Hoare triple {45276#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45277#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:08:03,219 INFO L290 TraceCheckUtils]: 64: Hoare triple {45277#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45278#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:08:03,219 INFO L290 TraceCheckUtils]: 65: Hoare triple {45278#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45279#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:08:03,220 INFO L290 TraceCheckUtils]: 66: Hoare triple {45279#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45280#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:08:03,220 INFO L290 TraceCheckUtils]: 67: Hoare triple {45280#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45281#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:08:03,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {45281#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45282#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-28 03:08:03,221 INFO L290 TraceCheckUtils]: 69: Hoare triple {45282#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45283#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-28 03:08:03,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {45283#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45284#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-28 03:08:03,222 INFO L290 TraceCheckUtils]: 71: Hoare triple {45284#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45285#(and (<= main_~y~0 66) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:08:03,222 INFO L290 TraceCheckUtils]: 72: Hoare triple {45285#(and (<= main_~y~0 66) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {45215#false} is VALID [2022-04-28 03:08:03,223 INFO L272 TraceCheckUtils]: 73: Hoare triple {45215#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {45215#false} is VALID [2022-04-28 03:08:03,223 INFO L290 TraceCheckUtils]: 74: Hoare triple {45215#false} ~cond := #in~cond; {45215#false} is VALID [2022-04-28 03:08:03,223 INFO L290 TraceCheckUtils]: 75: Hoare triple {45215#false} assume 0 == ~cond; {45215#false} is VALID [2022-04-28 03:08:03,223 INFO L290 TraceCheckUtils]: 76: Hoare triple {45215#false} assume !false; {45215#false} is VALID [2022-04-28 03:08:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:03,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:03,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632443129] [2022-04-28 03:08:03,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632443129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:03,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772465795] [2022-04-28 03:08:03,223 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:08:03,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:03,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:03,224 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:08:03,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-28 03:08:34,673 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-28 03:08:34,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:34,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 135 conjunts are in the unsatisfiable core [2022-04-28 03:08:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:34,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:35,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {45214#true} call ULTIMATE.init(); {45214#true} is VALID [2022-04-28 03:08:35,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {45214#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(12, 2);call #Ultimate.allocInit(12, 3); {45214#true} is VALID [2022-04-28 03:08:35,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {45214#true} assume true; {45214#true} is VALID [2022-04-28 03:08:35,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45214#true} {45214#true} #34#return; {45214#true} is VALID [2022-04-28 03:08:35,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {45214#true} call #t~ret5 := main(); {45214#true} is VALID [2022-04-28 03:08:35,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {45214#true} ~x~0 := 1;~y~0 := 0; {45219#(= main_~y~0 0)} is VALID [2022-04-28 03:08:35,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {45219#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45220#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:08:35,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {45220#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45221#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:08:35,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {45221#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45222#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:08:35,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {45222#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45223#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:08:35,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {45223#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45224#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:08:35,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {45224#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45225#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:08:35,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {45225#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45226#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:08:35,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {45226#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45227#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:08:35,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {45227#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45228#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:08:35,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {45228#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45229#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:08:35,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {45229#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45230#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:08:35,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {45230#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45231#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:08:35,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {45231#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45232#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:08:35,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {45232#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45233#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:08:35,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {45233#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45234#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:08:35,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {45234#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45235#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:08:35,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {45235#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45236#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:08:35,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {45236#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45237#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:08:35,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {45237#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45238#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:08:35,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {45238#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45239#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:08:35,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {45239#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45240#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:08:35,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {45240#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45241#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:08:35,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {45241#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45242#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:08:35,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {45242#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45243#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:08:35,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {45243#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45244#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:08:35,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {45244#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45245#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:08:35,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {45245#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45246#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:08:35,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {45246#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45247#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:08:35,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {45247#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45248#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:08:35,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {45248#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45249#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:08:35,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {45249#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45250#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:08:35,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {45250#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45251#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:08:35,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {45251#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45252#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:08:35,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {45252#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45253#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:08:35,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {45253#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45254#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:08:35,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {45254#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45255#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:08:35,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {45255#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45256#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:08:35,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {45256#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45257#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:08:35,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {45257#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45258#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:08:35,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {45258#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45259#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:08:35,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {45259#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45260#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:08:35,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {45260#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45261#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:08:35,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {45261#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45262#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:08:35,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {45262#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45263#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:08:35,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {45263#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45264#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:08:35,434 INFO L290 TraceCheckUtils]: 51: Hoare triple {45264#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45265#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:08:35,435 INFO L290 TraceCheckUtils]: 52: Hoare triple {45265#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45266#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:08:35,435 INFO L290 TraceCheckUtils]: 53: Hoare triple {45266#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45267#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:08:35,436 INFO L290 TraceCheckUtils]: 54: Hoare triple {45267#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45268#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:08:35,436 INFO L290 TraceCheckUtils]: 55: Hoare triple {45268#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45269#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:08:35,437 INFO L290 TraceCheckUtils]: 56: Hoare triple {45269#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45270#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:08:35,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {45270#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45271#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:08:35,438 INFO L290 TraceCheckUtils]: 58: Hoare triple {45271#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45272#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:08:35,438 INFO L290 TraceCheckUtils]: 59: Hoare triple {45272#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45273#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:08:35,439 INFO L290 TraceCheckUtils]: 60: Hoare triple {45273#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45274#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:08:35,439 INFO L290 TraceCheckUtils]: 61: Hoare triple {45274#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45275#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:08:35,440 INFO L290 TraceCheckUtils]: 62: Hoare triple {45275#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45276#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:08:35,440 INFO L290 TraceCheckUtils]: 63: Hoare triple {45276#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45277#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:08:35,441 INFO L290 TraceCheckUtils]: 64: Hoare triple {45277#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45278#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:08:35,441 INFO L290 TraceCheckUtils]: 65: Hoare triple {45278#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45279#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:08:35,442 INFO L290 TraceCheckUtils]: 66: Hoare triple {45279#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45280#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:08:35,442 INFO L290 TraceCheckUtils]: 67: Hoare triple {45280#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45281#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:08:35,443 INFO L290 TraceCheckUtils]: 68: Hoare triple {45281#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45282#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-28 03:08:35,443 INFO L290 TraceCheckUtils]: 69: Hoare triple {45282#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45283#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-28 03:08:35,444 INFO L290 TraceCheckUtils]: 70: Hoare triple {45283#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45284#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-28 03:08:35,444 INFO L290 TraceCheckUtils]: 71: Hoare triple {45284#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45503#(and (<= 66 main_~y~0) (<= main_~y~0 66))} is VALID [2022-04-28 03:08:35,445 INFO L290 TraceCheckUtils]: 72: Hoare triple {45503#(and (<= 66 main_~y~0) (<= main_~y~0 66))} assume !(~y~0 % 4294967296 < 1024); {45215#false} is VALID [2022-04-28 03:08:35,445 INFO L272 TraceCheckUtils]: 73: Hoare triple {45215#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {45215#false} is VALID [2022-04-28 03:08:35,445 INFO L290 TraceCheckUtils]: 74: Hoare triple {45215#false} ~cond := #in~cond; {45215#false} is VALID [2022-04-28 03:08:35,445 INFO L290 TraceCheckUtils]: 75: Hoare triple {45215#false} assume 0 == ~cond; {45215#false} is VALID [2022-04-28 03:08:35,445 INFO L290 TraceCheckUtils]: 76: Hoare triple {45215#false} assume !false; {45215#false} is VALID [2022-04-28 03:08:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:35,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:41,804 INFO L290 TraceCheckUtils]: 76: Hoare triple {45215#false} assume !false; {45215#false} is VALID [2022-04-28 03:08:41,804 INFO L290 TraceCheckUtils]: 75: Hoare triple {45215#false} assume 0 == ~cond; {45215#false} is VALID [2022-04-28 03:08:41,804 INFO L290 TraceCheckUtils]: 74: Hoare triple {45215#false} ~cond := #in~cond; {45215#false} is VALID [2022-04-28 03:08:41,804 INFO L272 TraceCheckUtils]: 73: Hoare triple {45215#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {45215#false} is VALID [2022-04-28 03:08:41,804 INFO L290 TraceCheckUtils]: 72: Hoare triple {45531#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {45215#false} is VALID [2022-04-28 03:08:41,805 INFO L290 TraceCheckUtils]: 71: Hoare triple {45535#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45531#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:08:41,805 INFO L290 TraceCheckUtils]: 70: Hoare triple {45539#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45535#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,806 INFO L290 TraceCheckUtils]: 69: Hoare triple {45543#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45539#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,807 INFO L290 TraceCheckUtils]: 68: Hoare triple {45547#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45543#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,807 INFO L290 TraceCheckUtils]: 67: Hoare triple {45551#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45547#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,808 INFO L290 TraceCheckUtils]: 66: Hoare triple {45555#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45551#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,809 INFO L290 TraceCheckUtils]: 65: Hoare triple {45559#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45555#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,809 INFO L290 TraceCheckUtils]: 64: Hoare triple {45563#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45559#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,810 INFO L290 TraceCheckUtils]: 63: Hoare triple {45567#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45563#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {45571#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45567#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,813 INFO L290 TraceCheckUtils]: 61: Hoare triple {45575#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45571#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,813 INFO L290 TraceCheckUtils]: 60: Hoare triple {45579#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45575#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,814 INFO L290 TraceCheckUtils]: 59: Hoare triple {45583#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45579#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {45587#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45583#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,815 INFO L290 TraceCheckUtils]: 57: Hoare triple {45591#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45587#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,815 INFO L290 TraceCheckUtils]: 56: Hoare triple {45595#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45591#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,816 INFO L290 TraceCheckUtils]: 55: Hoare triple {45599#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45595#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,817 INFO L290 TraceCheckUtils]: 54: Hoare triple {45603#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45599#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,817 INFO L290 TraceCheckUtils]: 53: Hoare triple {45607#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45603#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {45611#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45607#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,818 INFO L290 TraceCheckUtils]: 51: Hoare triple {45615#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45611#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {45619#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45615#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {45623#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45619#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {45627#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45623#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,821 INFO L290 TraceCheckUtils]: 47: Hoare triple {45631#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45627#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,821 INFO L290 TraceCheckUtils]: 46: Hoare triple {45635#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45631#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {45639#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45635#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,822 INFO L290 TraceCheckUtils]: 44: Hoare triple {45643#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45639#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {45647#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45643#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {45651#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45647#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {45655#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45651#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {45659#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45655#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {45663#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45659#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {45667#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45663#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {45671#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45667#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {45675#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45671#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {45679#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45675#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {45683#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45679#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {45687#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45683#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {45691#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45687#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {45695#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45691#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {45699#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45695#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {45703#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45699#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {45707#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45703#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {45711#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45707#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {45715#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45711#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {45719#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45715#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {45723#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45719#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {45727#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45723#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {45731#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45727#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {45735#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45731#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {45739#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45735#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {45743#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45739#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {45747#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45743#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {45751#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45747#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {45755#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45751#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {45759#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45755#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {45763#(< (mod (+ main_~y~0 58) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45759#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {45767#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45763#(< (mod (+ main_~y~0 58) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {45771#(< (mod (+ main_~y~0 60) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45767#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {45775#(< (mod (+ main_~y~0 61) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45771#(< (mod (+ main_~y~0 60) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {45779#(< (mod (+ main_~y~0 62) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45775#(< (mod (+ main_~y~0 61) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {45783#(< (mod (+ main_~y~0 63) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45779#(< (mod (+ main_~y~0 62) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {45787#(< (mod (+ 64 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45783#(< (mod (+ main_~y~0 63) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {45791#(< (mod (+ main_~y~0 65) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45787#(< (mod (+ 64 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {45795#(< (mod (+ 66 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {45791#(< (mod (+ main_~y~0 65) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {45214#true} ~x~0 := 1;~y~0 := 0; {45795#(< (mod (+ 66 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:08:41,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {45214#true} call #t~ret5 := main(); {45214#true} is VALID [2022-04-28 03:08:41,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45214#true} {45214#true} #34#return; {45214#true} is VALID [2022-04-28 03:08:41,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {45214#true} assume true; {45214#true} is VALID [2022-04-28 03:08:41,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {45214#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(12, 2);call #Ultimate.allocInit(12, 3); {45214#true} is VALID [2022-04-28 03:08:41,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {45214#true} call ULTIMATE.init(); {45214#true} is VALID [2022-04-28 03:08:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:41,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772465795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:08:41,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:08:41,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 69, 69] total 138 [2022-04-28 03:08:41,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:41,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [810025024] [2022-04-28 03:08:41,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [810025024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:41,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:41,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-28 03:08:41,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390562703] [2022-04-28 03:08:41,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:41,850 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 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 77 [2022-04-28 03:08:41,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:41,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 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-28 03:08:41,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:41,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-28 03:08:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:41,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-28 03:08:41,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4896, Invalid=14010, Unknown=0, NotChecked=0, Total=18906 [2022-04-28 03:08:41,904 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 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-28 03:08:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:50,107 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-28 03:08:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-28 03:08:50,107 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 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 77 [2022-04-28 03:08:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 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-28 03:08:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-04-28 03:08:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 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-28 03:08:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-04-28 03:08:50,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 84 transitions. [2022-04-28 03:08:50,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:50,158 INFO L225 Difference]: With dead ends: 84 [2022-04-28 03:08:50,158 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 03:08:50,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2349 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=9785, Invalid=32035, Unknown=0, NotChecked=0, Total=41820 [2022-04-28 03:08:50,160 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4549 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 4684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 4549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:50,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 4684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 4549 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 03:08:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 03:08:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-28 03:08:50,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:50,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:50,239 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:50,239 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:50,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:50,239 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-28 03:08:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-28 03:08:50,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:50,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:50,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-28 03:08:50,240 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-28 03:08:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:50,240 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-28 03:08:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-28 03:08:50,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:50,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:50,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:50,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2022-04-28 03:08:50,241 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2022-04-28 03:08:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:50,242 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2022-04-28 03:08:50,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 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-28 03:08:50,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 79 transitions. [2022-04-28 03:08:50,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-28 03:08:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 03:08:50,296 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:50,296 INFO L195 NwaCegarLoop]: trace histogram [67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:50,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-28 03:08:50,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2022-04-28 03:08:50,497 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:50,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash 721467190, now seen corresponding path program 133 times [2022-04-28 03:08:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:50,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [114894617] [2022-04-28 03:08:53,031 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:08:53,149 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:08:53,151 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:08:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2033644919, now seen corresponding path program 1 times [2022-04-28 03:08:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:53,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634637148] [2022-04-28 03:08:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:53,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:08:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:53,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:08:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash 721467190, now seen corresponding path program 134 times [2022-04-28 03:08:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:53,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256524853] [2022-04-28 03:08:53,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:55,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:55,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {46507#(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(12, 2);call #Ultimate.allocInit(12, 3); {46434#true} is VALID [2022-04-28 03:08:55,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {46434#true} assume true; {46434#true} is VALID [2022-04-28 03:08:55,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46434#true} {46434#true} #34#return; {46434#true} is VALID [2022-04-28 03:08:55,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {46434#true} call ULTIMATE.init(); {46507#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:55,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {46507#(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(12, 2);call #Ultimate.allocInit(12, 3); {46434#true} is VALID [2022-04-28 03:08:55,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {46434#true} assume true; {46434#true} is VALID [2022-04-28 03:08:55,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46434#true} {46434#true} #34#return; {46434#true} is VALID [2022-04-28 03:08:55,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {46434#true} call #t~ret5 := main(); {46434#true} is VALID [2022-04-28 03:08:55,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {46434#true} ~x~0 := 1;~y~0 := 0; {46439#(= main_~y~0 0)} is VALID [2022-04-28 03:08:55,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {46439#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46440#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:08:55,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {46440#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46441#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:08:55,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {46441#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46442#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:08:55,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {46442#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46443#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:08:55,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {46443#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46444#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:08:55,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {46444#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46445#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:08:55,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {46445#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46446#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:08:55,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {46446#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46447#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:08:55,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {46447#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46448#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:08:55,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {46448#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:08:55,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {46449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46450#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:08:55,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {46450#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46451#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:08:55,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {46451#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46452#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:08:55,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {46452#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46453#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:08:55,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {46453#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46454#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:08:55,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {46454#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46455#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:08:55,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {46455#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46456#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:08:55,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {46456#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46457#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:08:55,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {46457#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46458#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:08:55,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {46458#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46459#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:08:55,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {46459#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46460#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:08:55,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {46460#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46461#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:08:55,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {46461#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46462#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:08:55,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {46462#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46463#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:08:55,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {46463#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46464#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:08:55,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {46464#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46465#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:08:55,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {46465#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46466#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:08:55,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {46466#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46467#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:08:55,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {46467#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46468#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:08:55,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {46468#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46469#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:08:55,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {46469#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46470#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:08:55,191 INFO L290 TraceCheckUtils]: 37: Hoare triple {46470#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46471#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:08:55,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {46471#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46472#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:08:55,192 INFO L290 TraceCheckUtils]: 39: Hoare triple {46472#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46473#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:08:55,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {46473#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46474#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:08:55,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {46474#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46475#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:08:55,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {46475#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46476#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:08:55,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {46476#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46477#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:08:55,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {46477#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46478#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:08:55,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {46478#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46479#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:08:55,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {46479#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46480#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:08:55,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {46480#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46481#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:08:55,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {46481#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46482#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:08:55,197 INFO L290 TraceCheckUtils]: 49: Hoare triple {46482#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46483#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:08:55,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {46483#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46484#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:08:55,198 INFO L290 TraceCheckUtils]: 51: Hoare triple {46484#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46485#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:08:55,198 INFO L290 TraceCheckUtils]: 52: Hoare triple {46485#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46486#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:08:55,199 INFO L290 TraceCheckUtils]: 53: Hoare triple {46486#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46487#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:08:55,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {46487#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46488#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:08:55,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {46488#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46489#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:08:55,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {46489#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46490#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:08:55,201 INFO L290 TraceCheckUtils]: 57: Hoare triple {46490#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46491#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:08:55,201 INFO L290 TraceCheckUtils]: 58: Hoare triple {46491#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46492#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:08:55,202 INFO L290 TraceCheckUtils]: 59: Hoare triple {46492#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46493#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:08:55,202 INFO L290 TraceCheckUtils]: 60: Hoare triple {46493#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46494#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:08:55,203 INFO L290 TraceCheckUtils]: 61: Hoare triple {46494#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46495#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:08:55,203 INFO L290 TraceCheckUtils]: 62: Hoare triple {46495#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46496#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:08:55,204 INFO L290 TraceCheckUtils]: 63: Hoare triple {46496#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46497#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:08:55,204 INFO L290 TraceCheckUtils]: 64: Hoare triple {46497#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46498#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:08:55,205 INFO L290 TraceCheckUtils]: 65: Hoare triple {46498#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46499#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:08:55,205 INFO L290 TraceCheckUtils]: 66: Hoare triple {46499#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46500#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:08:55,206 INFO L290 TraceCheckUtils]: 67: Hoare triple {46500#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46501#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:08:55,206 INFO L290 TraceCheckUtils]: 68: Hoare triple {46501#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46502#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-28 03:08:55,206 INFO L290 TraceCheckUtils]: 69: Hoare triple {46502#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46503#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-28 03:08:55,207 INFO L290 TraceCheckUtils]: 70: Hoare triple {46503#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46504#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-28 03:08:55,207 INFO L290 TraceCheckUtils]: 71: Hoare triple {46504#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46505#(and (<= 66 main_~y~0) (<= main_~y~0 66))} is VALID [2022-04-28 03:08:55,208 INFO L290 TraceCheckUtils]: 72: Hoare triple {46505#(and (<= 66 main_~y~0) (<= main_~y~0 66))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46506#(and (<= main_~y~0 67) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:08:55,208 INFO L290 TraceCheckUtils]: 73: Hoare triple {46506#(and (<= main_~y~0 67) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {46435#false} is VALID [2022-04-28 03:08:55,208 INFO L272 TraceCheckUtils]: 74: Hoare triple {46435#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {46435#false} is VALID [2022-04-28 03:08:55,209 INFO L290 TraceCheckUtils]: 75: Hoare triple {46435#false} ~cond := #in~cond; {46435#false} is VALID [2022-04-28 03:08:55,209 INFO L290 TraceCheckUtils]: 76: Hoare triple {46435#false} assume 0 == ~cond; {46435#false} is VALID [2022-04-28 03:08:55,209 INFO L290 TraceCheckUtils]: 77: Hoare triple {46435#false} assume !false; {46435#false} is VALID [2022-04-28 03:08:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:55,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:55,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256524853] [2022-04-28 03:08:55,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256524853] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:55,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422681070] [2022-04-28 03:08:55,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:08:55,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:55,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:55,210 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:08:55,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-28 03:08:55,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:08:55,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:55,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 137 conjunts are in the unsatisfiable core [2022-04-28 03:08:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:55,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:56,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {46434#true} call ULTIMATE.init(); {46434#true} is VALID [2022-04-28 03:08:56,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {46434#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(12, 2);call #Ultimate.allocInit(12, 3); {46434#true} is VALID [2022-04-28 03:08:56,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {46434#true} assume true; {46434#true} is VALID [2022-04-28 03:08:56,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46434#true} {46434#true} #34#return; {46434#true} is VALID [2022-04-28 03:08:56,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {46434#true} call #t~ret5 := main(); {46434#true} is VALID [2022-04-28 03:08:56,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {46434#true} ~x~0 := 1;~y~0 := 0; {46439#(= main_~y~0 0)} is VALID [2022-04-28 03:08:56,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {46439#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46440#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:08:56,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {46440#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46441#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:08:56,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {46441#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46442#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:08:56,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {46442#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46443#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:08:56,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {46443#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46444#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:08:56,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {46444#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46445#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:08:56,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {46445#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46446#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:08:56,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {46446#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46447#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:08:56,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {46447#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46448#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:08:56,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {46448#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:08:56,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {46449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46450#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:08:56,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {46450#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46451#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:08:56,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {46451#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46452#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:08:56,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {46452#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46453#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:08:56,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {46453#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46454#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:08:56,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {46454#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46455#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:08:56,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {46455#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46456#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:08:56,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {46456#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46457#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:08:56,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {46457#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46458#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:08:56,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {46458#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46459#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:08:56,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {46459#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46460#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:08:56,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {46460#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46461#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:08:56,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {46461#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46462#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:08:56,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {46462#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46463#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:08:56,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {46463#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46464#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:08:56,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {46464#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46465#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:08:56,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {46465#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46466#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:08:56,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {46466#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46467#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:08:56,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {46467#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46468#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:08:56,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {46468#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46469#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:08:56,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {46469#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46470#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:08:56,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {46470#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46471#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:08:56,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {46471#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46472#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:08:56,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {46472#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46473#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:08:56,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {46473#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46474#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:08:56,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {46474#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46475#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:08:56,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {46475#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46476#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:08:56,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {46476#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46477#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:08:56,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {46477#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46478#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:08:56,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {46478#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46479#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:08:56,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {46479#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46480#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:08:56,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {46480#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46481#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:08:56,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {46481#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46482#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:08:56,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {46482#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46483#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:08:56,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {46483#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46484#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:08:56,062 INFO L290 TraceCheckUtils]: 51: Hoare triple {46484#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46485#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:08:56,062 INFO L290 TraceCheckUtils]: 52: Hoare triple {46485#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46486#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:08:56,063 INFO L290 TraceCheckUtils]: 53: Hoare triple {46486#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46487#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:08:56,063 INFO L290 TraceCheckUtils]: 54: Hoare triple {46487#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46488#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:08:56,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {46488#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46489#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:08:56,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {46489#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46490#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:08:56,065 INFO L290 TraceCheckUtils]: 57: Hoare triple {46490#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46491#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:08:56,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {46491#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46492#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:08:56,065 INFO L290 TraceCheckUtils]: 59: Hoare triple {46492#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46493#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:08:56,066 INFO L290 TraceCheckUtils]: 60: Hoare triple {46493#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46494#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:08:56,066 INFO L290 TraceCheckUtils]: 61: Hoare triple {46494#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46495#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:08:56,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {46495#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46496#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:08:56,067 INFO L290 TraceCheckUtils]: 63: Hoare triple {46496#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46497#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:08:56,068 INFO L290 TraceCheckUtils]: 64: Hoare triple {46497#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46498#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:08:56,068 INFO L290 TraceCheckUtils]: 65: Hoare triple {46498#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46499#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:08:56,069 INFO L290 TraceCheckUtils]: 66: Hoare triple {46499#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46500#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:08:56,069 INFO L290 TraceCheckUtils]: 67: Hoare triple {46500#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46501#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:08:56,070 INFO L290 TraceCheckUtils]: 68: Hoare triple {46501#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46502#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-28 03:08:56,070 INFO L290 TraceCheckUtils]: 69: Hoare triple {46502#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46503#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-28 03:08:56,071 INFO L290 TraceCheckUtils]: 70: Hoare triple {46503#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46504#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-28 03:08:56,071 INFO L290 TraceCheckUtils]: 71: Hoare triple {46504#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46505#(and (<= 66 main_~y~0) (<= main_~y~0 66))} is VALID [2022-04-28 03:08:56,072 INFO L290 TraceCheckUtils]: 72: Hoare triple {46505#(and (<= 66 main_~y~0) (<= main_~y~0 66))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46727#(and (<= main_~y~0 67) (<= 67 main_~y~0))} is VALID [2022-04-28 03:08:56,072 INFO L290 TraceCheckUtils]: 73: Hoare triple {46727#(and (<= main_~y~0 67) (<= 67 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {46435#false} is VALID [2022-04-28 03:08:56,072 INFO L272 TraceCheckUtils]: 74: Hoare triple {46435#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {46435#false} is VALID [2022-04-28 03:08:56,072 INFO L290 TraceCheckUtils]: 75: Hoare triple {46435#false} ~cond := #in~cond; {46435#false} is VALID [2022-04-28 03:08:56,072 INFO L290 TraceCheckUtils]: 76: Hoare triple {46435#false} assume 0 == ~cond; {46435#false} is VALID [2022-04-28 03:08:56,072 INFO L290 TraceCheckUtils]: 77: Hoare triple {46435#false} assume !false; {46435#false} is VALID [2022-04-28 03:08:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:56,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:09:02,545 INFO L290 TraceCheckUtils]: 77: Hoare triple {46435#false} assume !false; {46435#false} is VALID [2022-04-28 03:09:02,545 INFO L290 TraceCheckUtils]: 76: Hoare triple {46435#false} assume 0 == ~cond; {46435#false} is VALID [2022-04-28 03:09:02,545 INFO L290 TraceCheckUtils]: 75: Hoare triple {46435#false} ~cond := #in~cond; {46435#false} is VALID [2022-04-28 03:09:02,545 INFO L272 TraceCheckUtils]: 74: Hoare triple {46435#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {46435#false} is VALID [2022-04-28 03:09:02,545 INFO L290 TraceCheckUtils]: 73: Hoare triple {46755#(< (mod main_~y~0 4294967296) 1024)} assume !(~y~0 % 4294967296 < 1024); {46435#false} is VALID [2022-04-28 03:09:02,546 INFO L290 TraceCheckUtils]: 72: Hoare triple {46759#(< (mod (+ main_~y~0 1) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46755#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-28 03:09:02,547 INFO L290 TraceCheckUtils]: 71: Hoare triple {46763#(< (mod (+ main_~y~0 2) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46759#(< (mod (+ main_~y~0 1) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,548 INFO L290 TraceCheckUtils]: 70: Hoare triple {46767#(< (mod (+ main_~y~0 3) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46763#(< (mod (+ main_~y~0 2) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,548 INFO L290 TraceCheckUtils]: 69: Hoare triple {46771#(< (mod (+ main_~y~0 4) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46767#(< (mod (+ main_~y~0 3) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,549 INFO L290 TraceCheckUtils]: 68: Hoare triple {46775#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46771#(< (mod (+ main_~y~0 4) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,549 INFO L290 TraceCheckUtils]: 67: Hoare triple {46779#(< (mod (+ main_~y~0 6) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46775#(< (mod (+ 5 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {46783#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46779#(< (mod (+ main_~y~0 6) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {46787#(< (mod (+ main_~y~0 8) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46783#(< (mod (+ 7 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {46791#(< (mod (+ main_~y~0 9) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46787#(< (mod (+ main_~y~0 8) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {46795#(< (mod (+ main_~y~0 10) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46791#(< (mod (+ main_~y~0 9) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {46799#(< (mod (+ main_~y~0 11) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46795#(< (mod (+ main_~y~0 10) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,553 INFO L290 TraceCheckUtils]: 61: Hoare triple {46803#(< (mod (+ main_~y~0 12) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46799#(< (mod (+ main_~y~0 11) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,553 INFO L290 TraceCheckUtils]: 60: Hoare triple {46807#(< (mod (+ main_~y~0 13) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46803#(< (mod (+ main_~y~0 12) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,554 INFO L290 TraceCheckUtils]: 59: Hoare triple {46811#(< (mod (+ main_~y~0 14) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46807#(< (mod (+ main_~y~0 13) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {46815#(< (mod (+ main_~y~0 15) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46811#(< (mod (+ main_~y~0 14) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,555 INFO L290 TraceCheckUtils]: 57: Hoare triple {46819#(< (mod (+ main_~y~0 16) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46815#(< (mod (+ main_~y~0 15) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,556 INFO L290 TraceCheckUtils]: 56: Hoare triple {46823#(< (mod (+ main_~y~0 17) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46819#(< (mod (+ main_~y~0 16) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,556 INFO L290 TraceCheckUtils]: 55: Hoare triple {46827#(< (mod (+ main_~y~0 18) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46823#(< (mod (+ main_~y~0 17) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {46831#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46827#(< (mod (+ main_~y~0 18) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {46835#(< (mod (+ main_~y~0 20) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46831#(< (mod (+ 19 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {46839#(< (mod (+ main_~y~0 21) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46835#(< (mod (+ main_~y~0 20) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {46843#(< (mod (+ main_~y~0 22) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46839#(< (mod (+ main_~y~0 21) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {46847#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46843#(< (mod (+ main_~y~0 22) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {46851#(< (mod (+ main_~y~0 24) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46847#(< (mod (+ 23 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,571 INFO L290 TraceCheckUtils]: 48: Hoare triple {46855#(< (mod (+ main_~y~0 25) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46851#(< (mod (+ main_~y~0 24) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,571 INFO L290 TraceCheckUtils]: 47: Hoare triple {46859#(< (mod (+ main_~y~0 26) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46855#(< (mod (+ main_~y~0 25) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {46863#(< (mod (+ main_~y~0 27) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46859#(< (mod (+ main_~y~0 26) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {46867#(< (mod (+ main_~y~0 28) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46863#(< (mod (+ main_~y~0 27) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {46871#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46867#(< (mod (+ main_~y~0 28) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {46875#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46871#(< (mod (+ 29 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {46879#(< (mod (+ main_~y~0 31) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46875#(< (mod (+ 30 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,575 INFO L290 TraceCheckUtils]: 41: Hoare triple {46883#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46879#(< (mod (+ main_~y~0 31) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {46887#(< (mod (+ main_~y~0 33) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46883#(< (mod (+ 32 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,576 INFO L290 TraceCheckUtils]: 39: Hoare triple {46891#(< (mod (+ main_~y~0 34) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46887#(< (mod (+ main_~y~0 33) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {46895#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46891#(< (mod (+ main_~y~0 34) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,578 INFO L290 TraceCheckUtils]: 37: Hoare triple {46899#(< (mod (+ main_~y~0 36) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46895#(< (mod (+ 35 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {46903#(< (mod (+ main_~y~0 37) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46899#(< (mod (+ main_~y~0 36) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {46907#(< (mod (+ main_~y~0 38) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46903#(< (mod (+ main_~y~0 37) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {46911#(< (mod (+ main_~y~0 39) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46907#(< (mod (+ main_~y~0 38) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {46915#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46911#(< (mod (+ main_~y~0 39) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {46919#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46915#(< (mod (+ 40 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {46923#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46919#(< (mod (+ 41 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {46927#(< (mod (+ main_~y~0 43) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46923#(< (mod (+ 42 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {46931#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46927#(< (mod (+ main_~y~0 43) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {46935#(< (mod (+ main_~y~0 45) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46931#(< (mod (+ 44 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {46939#(< (mod (+ main_~y~0 46) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46935#(< (mod (+ main_~y~0 45) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {46943#(< (mod (+ main_~y~0 47) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46939#(< (mod (+ main_~y~0 46) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {46947#(< (mod (+ main_~y~0 48) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46943#(< (mod (+ main_~y~0 47) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {46951#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46947#(< (mod (+ main_~y~0 48) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {46955#(< (mod (+ main_~y~0 50) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46951#(< (mod (+ 49 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {46959#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46955#(< (mod (+ main_~y~0 50) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {46963#(< (mod (+ main_~y~0 52) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46959#(< (mod (+ 51 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {46967#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46963#(< (mod (+ main_~y~0 52) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {46971#(< (mod (+ main_~y~0 54) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46967#(< (mod (+ 53 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {46975#(< (mod (+ main_~y~0 55) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46971#(< (mod (+ main_~y~0 54) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {46979#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46975#(< (mod (+ main_~y~0 55) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {46983#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46979#(< (mod (+ 56 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {46987#(< (mod (+ main_~y~0 58) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46983#(< (mod (+ 57 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {46991#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46987#(< (mod (+ main_~y~0 58) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {46995#(< (mod (+ main_~y~0 60) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46991#(< (mod (+ 59 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {46999#(< (mod (+ main_~y~0 61) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46995#(< (mod (+ main_~y~0 60) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {47003#(< (mod (+ main_~y~0 62) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {46999#(< (mod (+ main_~y~0 61) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {47007#(< (mod (+ main_~y~0 63) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47003#(< (mod (+ main_~y~0 62) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {47011#(< (mod (+ 64 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47007#(< (mod (+ main_~y~0 63) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {47015#(< (mod (+ main_~y~0 65) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47011#(< (mod (+ 64 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {47019#(< (mod (+ 66 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47015#(< (mod (+ main_~y~0 65) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {47023#(< (mod (+ 67 main_~y~0) 4294967296) 1024)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47019#(< (mod (+ 66 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {46434#true} ~x~0 := 1;~y~0 := 0; {47023#(< (mod (+ 67 main_~y~0) 4294967296) 1024)} is VALID [2022-04-28 03:09:02,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {46434#true} call #t~ret5 := main(); {46434#true} is VALID [2022-04-28 03:09:02,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46434#true} {46434#true} #34#return; {46434#true} is VALID [2022-04-28 03:09:02,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {46434#true} assume true; {46434#true} is VALID [2022-04-28 03:09:02,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {46434#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(12, 2);call #Ultimate.allocInit(12, 3); {46434#true} is VALID [2022-04-28 03:09:02,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {46434#true} call ULTIMATE.init(); {46434#true} is VALID [2022-04-28 03:09:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:02,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422681070] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:09:02,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:09:02,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 140 [2022-04-28 03:09:02,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:02,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [114894617] [2022-04-28 03:09:02,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [114894617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:02,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:02,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-04-28 03:09:02,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609084338] [2022-04-28 03:09:02,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:02,600 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 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 78 [2022-04-28 03:09:02,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:02,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 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-28 03:09:02,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:02,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-04-28 03:09:02,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:02,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-04-28 03:09:02,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5037, Invalid=14423, Unknown=0, NotChecked=0, Total=19460 [2022-04-28 03:09:02,646 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 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-28 03:09:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:11,010 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2022-04-28 03:09:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-04-28 03:09:11,010 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 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 78 [2022-04-28 03:09:11,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 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-28 03:09:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2022-04-28 03:09:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 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-28 03:09:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2022-04-28 03:09:11,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 85 transitions. [2022-04-28 03:09:11,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:11,061 INFO L225 Difference]: With dead ends: 85 [2022-04-28 03:09:11,061 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 03:09:11,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2418 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=10067, Invalid=32989, Unknown=0, NotChecked=0, Total=43056 [2022-04-28 03:09:11,063 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4623 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 4623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:11,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 4760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 4623 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 03:09:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 03:09:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-28 03:09:11,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:11,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 80 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 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-28 03:09:11,158 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 80 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 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-28 03:09:11,159 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 80 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 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-28 03:09:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:11,159 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 03:09:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-28 03:09:11,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:11,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:11,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 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 80 states. [2022-04-28 03:09:11,160 INFO L87 Difference]: Start difference. First operand has 80 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 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 80 states. [2022-04-28 03:09:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:11,160 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 03:09:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-28 03:09:11,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:11,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:11,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:11,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 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-28 03:09:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2022-04-28 03:09:11,161 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2022-04-28 03:09:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:11,161 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2022-04-28 03:09:11,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 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-28 03:09:11,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 80 transitions. [2022-04-28 03:09:11,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-28 03:09:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 03:09:11,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:11,218 INFO L195 NwaCegarLoop]: trace histogram [68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:11,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-28 03:09:11,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134,SelfDestructingSolverStorable135 [2022-04-28 03:09:11,419 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:11,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:11,419 INFO L85 PathProgramCache]: Analyzing trace with hash 927107676, now seen corresponding path program 135 times [2022-04-28 03:09:11,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:11,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1757838958] [2022-04-28 03:09:12,594 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:09:12,705 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:09:12,706 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:09:12,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2092750263, now seen corresponding path program 1 times [2022-04-28 03:09:12,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:12,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209263992] [2022-04-28 03:09:12,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:12,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:09:12,711 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:09:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:09:12,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:09:12,714 INFO L85 PathProgramCache]: Analyzing trace with hash 927107676, now seen corresponding path program 136 times [2022-04-28 03:09:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:12,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114765830] [2022-04-28 03:09:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:12,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:14,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:14,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {47744#(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(12, 2);call #Ultimate.allocInit(12, 3); {47670#true} is VALID [2022-04-28 03:09:14,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {47670#true} assume true; {47670#true} is VALID [2022-04-28 03:09:14,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47670#true} {47670#true} #34#return; {47670#true} is VALID [2022-04-28 03:09:14,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {47670#true} call ULTIMATE.init(); {47744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:14,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {47744#(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(12, 2);call #Ultimate.allocInit(12, 3); {47670#true} is VALID [2022-04-28 03:09:14,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {47670#true} assume true; {47670#true} is VALID [2022-04-28 03:09:14,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47670#true} {47670#true} #34#return; {47670#true} is VALID [2022-04-28 03:09:14,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {47670#true} call #t~ret5 := main(); {47670#true} is VALID [2022-04-28 03:09:14,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {47670#true} ~x~0 := 1;~y~0 := 0; {47675#(= main_~y~0 0)} is VALID [2022-04-28 03:09:14,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {47675#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47676#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:09:14,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {47676#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47677#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:09:14,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {47677#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47678#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:09:14,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {47678#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47679#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:09:14,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {47679#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47680#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:09:14,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {47680#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47681#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:09:14,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {47681#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47682#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:09:14,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {47682#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47683#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:09:14,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {47683#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47684#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:09:14,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {47684#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47685#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:09:14,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {47685#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47686#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:09:14,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {47686#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47687#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:09:14,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {47687#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47688#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:09:14,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {47688#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47689#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:09:14,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {47689#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47690#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:09:14,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {47690#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47691#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:09:14,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {47691#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47692#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:09:14,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {47692#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47693#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:09:14,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {47693#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47694#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:09:14,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {47694#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47695#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:09:14,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {47695#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47696#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:09:14,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {47696#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47697#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:09:14,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {47697#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47698#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:09:14,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {47698#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47699#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:09:14,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {47699#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47700#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:09:14,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {47700#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47701#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:09:14,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {47701#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47702#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:09:14,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {47702#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47703#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:09:14,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {47703#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47704#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:09:14,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {47704#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47705#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:09:14,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {47705#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47706#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:09:14,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {47706#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47707#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:09:14,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {47707#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47708#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:09:14,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {47708#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47709#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:09:14,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {47709#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47710#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:09:14,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {47710#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47711#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:09:14,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {47711#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47712#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:09:14,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {47712#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47713#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:09:14,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {47713#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47714#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:09:14,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {47714#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47715#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:09:14,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {47715#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47716#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:09:14,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {47716#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47717#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:09:14,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {47717#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47718#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:09:14,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {47718#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47719#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:09:14,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {47719#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47720#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:09:14,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {47720#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47721#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:09:14,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {47721#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47722#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:09:14,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {47722#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47723#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:09:14,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {47723#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47724#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:09:14,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {47724#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47725#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:09:14,822 INFO L290 TraceCheckUtils]: 56: Hoare triple {47725#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47726#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:09:14,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {47726#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47727#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:09:14,823 INFO L290 TraceCheckUtils]: 58: Hoare triple {47727#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47728#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:09:14,823 INFO L290 TraceCheckUtils]: 59: Hoare triple {47728#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47729#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:09:14,823 INFO L290 TraceCheckUtils]: 60: Hoare triple {47729#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47730#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:09:14,824 INFO L290 TraceCheckUtils]: 61: Hoare triple {47730#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47731#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:09:14,824 INFO L290 TraceCheckUtils]: 62: Hoare triple {47731#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47732#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:09:14,825 INFO L290 TraceCheckUtils]: 63: Hoare triple {47732#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47733#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:09:14,825 INFO L290 TraceCheckUtils]: 64: Hoare triple {47733#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47734#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:09:14,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {47734#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47735#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:09:14,826 INFO L290 TraceCheckUtils]: 66: Hoare triple {47735#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47736#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:09:14,827 INFO L290 TraceCheckUtils]: 67: Hoare triple {47736#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47737#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:09:14,827 INFO L290 TraceCheckUtils]: 68: Hoare triple {47737#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47738#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-28 03:09:14,828 INFO L290 TraceCheckUtils]: 69: Hoare triple {47738#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47739#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-28 03:09:14,828 INFO L290 TraceCheckUtils]: 70: Hoare triple {47739#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47740#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-28 03:09:14,829 INFO L290 TraceCheckUtils]: 71: Hoare triple {47740#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47741#(and (<= 66 main_~y~0) (<= main_~y~0 66))} is VALID [2022-04-28 03:09:14,829 INFO L290 TraceCheckUtils]: 72: Hoare triple {47741#(and (<= 66 main_~y~0) (<= main_~y~0 66))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47742#(and (<= main_~y~0 67) (<= 67 main_~y~0))} is VALID [2022-04-28 03:09:14,830 INFO L290 TraceCheckUtils]: 73: Hoare triple {47742#(and (<= main_~y~0 67) (<= 67 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47743#(and (<= main_~y~0 68) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:09:14,830 INFO L290 TraceCheckUtils]: 74: Hoare triple {47743#(and (<= main_~y~0 68) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~y~0 % 4294967296 < 1024); {47671#false} is VALID [2022-04-28 03:09:14,830 INFO L272 TraceCheckUtils]: 75: Hoare triple {47671#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {47671#false} is VALID [2022-04-28 03:09:14,830 INFO L290 TraceCheckUtils]: 76: Hoare triple {47671#false} ~cond := #in~cond; {47671#false} is VALID [2022-04-28 03:09:14,830 INFO L290 TraceCheckUtils]: 77: Hoare triple {47671#false} assume 0 == ~cond; {47671#false} is VALID [2022-04-28 03:09:14,830 INFO L290 TraceCheckUtils]: 78: Hoare triple {47671#false} assume !false; {47671#false} is VALID [2022-04-28 03:09:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:14,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:14,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114765830] [2022-04-28 03:09:14,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114765830] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:09:14,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897921626] [2022-04-28 03:09:14,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:09:14,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:14,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:14,832 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:09:14,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-28 03:09:14,986 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:09:14,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:09:14,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 139 conjunts are in the unsatisfiable core [2022-04-28 03:09:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:15,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:09:15,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {47670#true} call ULTIMATE.init(); {47670#true} is VALID [2022-04-28 03:09:15,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {47670#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(12, 2);call #Ultimate.allocInit(12, 3); {47670#true} is VALID [2022-04-28 03:09:15,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {47670#true} assume true; {47670#true} is VALID [2022-04-28 03:09:15,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47670#true} {47670#true} #34#return; {47670#true} is VALID [2022-04-28 03:09:15,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {47670#true} call #t~ret5 := main(); {47670#true} is VALID [2022-04-28 03:09:15,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {47670#true} ~x~0 := 1;~y~0 := 0; {47675#(= main_~y~0 0)} is VALID [2022-04-28 03:09:15,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {47675#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47676#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 03:09:15,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {47676#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47677#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 03:09:15,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {47677#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47678#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 03:09:15,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {47678#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47679#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 03:09:15,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {47679#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47680#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 03:09:15,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {47680#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47681#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 03:09:15,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {47681#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47682#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 03:09:15,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {47682#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47683#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 03:09:15,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {47683#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47684#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 03:09:15,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {47684#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47685#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 03:09:15,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {47685#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47686#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 03:09:15,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {47686#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47687#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 03:09:15,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {47687#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47688#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 03:09:15,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {47688#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47689#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 03:09:15,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {47689#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47690#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 03:09:15,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {47690#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47691#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 03:09:15,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {47691#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47692#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 03:09:15,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {47692#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47693#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 03:09:15,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {47693#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47694#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 03:09:15,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {47694#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47695#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 03:09:15,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {47695#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47696#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 03:09:15,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {47696#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47697#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 03:09:15,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {47697#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47698#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 03:09:15,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {47698#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47699#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 03:09:15,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {47699#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47700#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 03:09:15,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {47700#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47701#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 03:09:15,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {47701#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47702#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 03:09:15,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {47702#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47703#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 03:09:15,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {47703#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47704#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 03:09:15,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {47704#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47705#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 03:09:15,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {47705#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47706#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 03:09:15,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {47706#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47707#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 03:09:15,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {47707#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47708#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 03:09:15,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {47708#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47709#(and (<= main_~y~0 34) (<= 34 main_~y~0))} is VALID [2022-04-28 03:09:15,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {47709#(and (<= main_~y~0 34) (<= 34 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47710#(and (<= 35 main_~y~0) (<= main_~y~0 35))} is VALID [2022-04-28 03:09:15,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {47710#(and (<= 35 main_~y~0) (<= main_~y~0 35))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47711#(and (<= 36 main_~y~0) (<= main_~y~0 36))} is VALID [2022-04-28 03:09:15,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {47711#(and (<= 36 main_~y~0) (<= main_~y~0 36))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47712#(and (<= main_~y~0 37) (<= 37 main_~y~0))} is VALID [2022-04-28 03:09:15,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {47712#(and (<= main_~y~0 37) (<= 37 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47713#(and (<= 38 main_~y~0) (<= main_~y~0 38))} is VALID [2022-04-28 03:09:15,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {47713#(and (<= 38 main_~y~0) (<= main_~y~0 38))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47714#(and (<= 39 main_~y~0) (<= main_~y~0 39))} is VALID [2022-04-28 03:09:15,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {47714#(and (<= 39 main_~y~0) (<= main_~y~0 39))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47715#(and (<= 40 main_~y~0) (<= main_~y~0 40))} is VALID [2022-04-28 03:09:15,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {47715#(and (<= 40 main_~y~0) (<= main_~y~0 40))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47716#(and (<= 41 main_~y~0) (<= main_~y~0 41))} is VALID [2022-04-28 03:09:15,799 INFO L290 TraceCheckUtils]: 47: Hoare triple {47716#(and (<= 41 main_~y~0) (<= main_~y~0 41))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47717#(and (<= main_~y~0 42) (<= 42 main_~y~0))} is VALID [2022-04-28 03:09:15,799 INFO L290 TraceCheckUtils]: 48: Hoare triple {47717#(and (<= main_~y~0 42) (<= 42 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47718#(and (<= 43 main_~y~0) (<= main_~y~0 43))} is VALID [2022-04-28 03:09:15,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {47718#(and (<= 43 main_~y~0) (<= main_~y~0 43))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47719#(and (<= main_~y~0 44) (<= 44 main_~y~0))} is VALID [2022-04-28 03:09:15,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {47719#(and (<= main_~y~0 44) (<= 44 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47720#(and (<= main_~y~0 45) (<= 45 main_~y~0))} is VALID [2022-04-28 03:09:15,801 INFO L290 TraceCheckUtils]: 51: Hoare triple {47720#(and (<= main_~y~0 45) (<= 45 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47721#(and (<= main_~y~0 46) (<= 46 main_~y~0))} is VALID [2022-04-28 03:09:15,801 INFO L290 TraceCheckUtils]: 52: Hoare triple {47721#(and (<= main_~y~0 46) (<= 46 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47722#(and (<= main_~y~0 47) (<= 47 main_~y~0))} is VALID [2022-04-28 03:09:15,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {47722#(and (<= main_~y~0 47) (<= 47 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47723#(and (<= 48 main_~y~0) (<= main_~y~0 48))} is VALID [2022-04-28 03:09:15,802 INFO L290 TraceCheckUtils]: 54: Hoare triple {47723#(and (<= 48 main_~y~0) (<= main_~y~0 48))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47724#(and (<= 49 main_~y~0) (<= main_~y~0 49))} is VALID [2022-04-28 03:09:15,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {47724#(and (<= 49 main_~y~0) (<= main_~y~0 49))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47725#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-28 03:09:15,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {47725#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47726#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-28 03:09:15,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {47726#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47727#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-28 03:09:15,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {47727#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47728#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-28 03:09:15,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {47728#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47729#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-28 03:09:15,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {47729#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47730#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-28 03:09:15,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {47730#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47731#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-28 03:09:15,806 INFO L290 TraceCheckUtils]: 62: Hoare triple {47731#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47732#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-28 03:09:15,806 INFO L290 TraceCheckUtils]: 63: Hoare triple {47732#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47733#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-28 03:09:15,807 INFO L290 TraceCheckUtils]: 64: Hoare triple {47733#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47734#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-28 03:09:15,807 INFO L290 TraceCheckUtils]: 65: Hoare triple {47734#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47735#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-28 03:09:15,808 INFO L290 TraceCheckUtils]: 66: Hoare triple {47735#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47736#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-28 03:09:15,808 INFO L290 TraceCheckUtils]: 67: Hoare triple {47736#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47737#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-28 03:09:15,809 INFO L290 TraceCheckUtils]: 68: Hoare triple {47737#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47738#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-28 03:09:15,809 INFO L290 TraceCheckUtils]: 69: Hoare triple {47738#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47739#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-28 03:09:15,810 INFO L290 TraceCheckUtils]: 70: Hoare triple {47739#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47740#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-28 03:09:15,810 INFO L290 TraceCheckUtils]: 71: Hoare triple {47740#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47741#(and (<= 66 main_~y~0) (<= main_~y~0 66))} is VALID [2022-04-28 03:09:15,810 INFO L290 TraceCheckUtils]: 72: Hoare triple {47741#(and (<= 66 main_~y~0) (<= main_~y~0 66))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47742#(and (<= main_~y~0 67) (<= 67 main_~y~0))} is VALID [2022-04-28 03:09:15,811 INFO L290 TraceCheckUtils]: 73: Hoare triple {47742#(and (<= main_~y~0 67) (<= 67 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {47967#(and (<= main_~y~0 68) (<= 68 main_~y~0))} is VALID [2022-04-28 03:09:15,811 INFO L290 TraceCheckUtils]: 74: Hoare triple {47967#(and (<= main_~y~0 68) (<= 68 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {47671#false} is VALID [2022-04-28 03:09:15,811 INFO L272 TraceCheckUtils]: 75: Hoare triple {47671#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {47671#false} is VALID [2022-04-28 03:09:15,812 INFO L290 TraceCheckUtils]: 76: Hoare triple {47671#false} ~cond := #in~cond; {47671#false} is VALID [2022-04-28 03:09:15,812 INFO L290 TraceCheckUtils]: 77: Hoare triple {47671#false} assume 0 == ~cond; {47671#false} is VALID [2022-04-28 03:09:15,812 INFO L290 TraceCheckUtils]: 78: Hoare triple {47671#false} assume !false; {47671#false} is VALID [2022-04-28 03:09:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:15,812 INFO L328 TraceCheckSpWp]: Computing backward predicates...