/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:14:58,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:14:58,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:14:58,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:14:58,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:14:58,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:14:58,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:14:58,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:14:58,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:14:58,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:14:58,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:14:58,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:14:58,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:14:58,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:14:58,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:14:58,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:14:58,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:14:58,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:14:58,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:14:58,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:14:58,683 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:14:58,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:14:58,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:14:58,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:14:58,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:14:58,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:14:58,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:14:58,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:14:58,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:14:58,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:14:58,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:14:58,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:14:58,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:14:58,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:14:58,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:14:58,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:14:58,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:14:58,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:14:58,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:14:58,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:14:58,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:14:58,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:14:58,694 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:14:58,700 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:14:58,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:14:58,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:14:58,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:14:58,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:14:58,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:14:58,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:14:58,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:14:58,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:14:58,701 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:14:58,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:14:58,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:14:58,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:14:58,702 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:14:58,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:14:58,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:14:58,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:14:58,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:14:58,702 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:14:58,702 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:14:58,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:14:58,703 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:14:58,703 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 09:14:58,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:14:58,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:14:58,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:14:58,896 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:14:58,896 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:14:58,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2022-04-28 09:14:58,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe1bbbc0/d3a864b05fee40b7bf59bcf53ef7f841/FLAG3a762d00e [2022-04-28 09:14:59,337 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:14:59,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2022-04-28 09:14:59,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe1bbbc0/d3a864b05fee40b7bf59bcf53ef7f841/FLAG3a762d00e [2022-04-28 09:14:59,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe1bbbc0/d3a864b05fee40b7bf59bcf53ef7f841 [2022-04-28 09:14:59,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:14:59,360 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:14:59,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:14:59,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:14:59,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:14:59,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:14:59" (1/1) ... [2022-04-28 09:14:59,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be3cbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:14:59, skipping insertion in model container [2022-04-28 09:14:59,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:14:59" (1/1) ... [2022-04-28 09:14:59,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:14:59,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:14:59,520 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/diamond_1-1.c[373,386] [2022-04-28 09:14:59,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:14:59,541 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:14:59,549 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/diamond_1-1.c[373,386] [2022-04-28 09:14:59,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:14:59,565 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:14:59,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:14:59 WrapperNode [2022-04-28 09:14:59,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:14:59,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:14:59,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:14:59,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:14:59,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:14:59" (1/1) ... [2022-04-28 09:14:59,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:14:59" (1/1) ... [2022-04-28 09:14:59,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:14:59" (1/1) ... [2022-04-28 09:14:59,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:14:59" (1/1) ... [2022-04-28 09:14:59,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:14:59" (1/1) ... [2022-04-28 09:14:59,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:14:59" (1/1) ... [2022-04-28 09:14:59,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:14:59" (1/1) ... [2022-04-28 09:14:59,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:14:59,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:14:59,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:14:59,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:14:59,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:14:59" (1/1) ... [2022-04-28 09:14:59,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:14:59,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:14:59,628 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 09:14:59,673 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 09:14:59,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:14:59,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:14:59,693 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:14:59,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:14:59,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:14:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:14:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:14:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:14:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:14:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 09:14:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:14:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:14:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:14:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:14:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:14:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:14:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:14:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:14:59,737 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:14:59,738 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:14:59,816 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:14:59,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:14:59,821 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:14:59,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:14:59 BoogieIcfgContainer [2022-04-28 09:14:59,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:14:59,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:14:59,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:14:59,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:14:59,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:14:59" (1/3) ... [2022-04-28 09:14:59,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e273086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:14:59, skipping insertion in model container [2022-04-28 09:14:59,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:14:59" (2/3) ... [2022-04-28 09:14:59,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e273086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:14:59, skipping insertion in model container [2022-04-28 09:14:59,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:14:59" (3/3) ... [2022-04-28 09:14:59,826 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2022-04-28 09:14:59,835 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:14:59,835 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:14:59,860 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:14:59,865 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@11183bf1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@354b540e [2022-04-28 09:14:59,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:14:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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 09:14:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:14:59,885 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:14:59,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:14:59,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:14:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:14:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 1 times [2022-04-28 09:14:59,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:14:59,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [408290035] [2022-04-28 09:14:59,901 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:14:59,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 2 times [2022-04-28 09:14:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:14:59,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654696832] [2022-04-28 09:14:59,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:14:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:14:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:00,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:00,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(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(14, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-28 09:15:00,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 09:15:00,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-28 09:15:00,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:00,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(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(14, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-28 09:15:00,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 09:15:00,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-28 09:15:00,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret6 := main(); {22#true} is VALID [2022-04-28 09:15:00,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {22#true} is VALID [2022-04-28 09:15:00,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-28 09:15:00,066 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23#false} is VALID [2022-04-28 09:15:00,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-28 09:15:00,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-28 09:15:00,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-28 09:15:00,067 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 09:15:00,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:00,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654696832] [2022-04-28 09:15:00,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654696832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:00,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:00,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:15:00,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:00,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [408290035] [2022-04-28 09:15:00,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [408290035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:00,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:00,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:15:00,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38359900] [2022-04-28 09:15:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:00,074 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 09:15:00,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:00,077 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 09:15:00,089 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 09:15:00,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:15:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:00,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:15:00,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:15:00,104 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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 09:15:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:00,151 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 09:15:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:15:00,151 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 09:15:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:00,152 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 09:15:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-28 09:15:00,156 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 09:15:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-28 09:15:00,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-28 09:15:00,191 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 09:15:00,196 INFO L225 Difference]: With dead ends: 30 [2022-04-28 09:15:00,196 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 09:15:00,198 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 09:15:00,200 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 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 09:15:00,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:15:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 09:15:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 09:15:00,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:00,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 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 09:15:00,219 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 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 09:15:00,219 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 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 09:15:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:00,221 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 09:15:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 09:15:00,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:00,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:00,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 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 13 states. [2022-04-28 09:15:00,222 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 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 13 states. [2022-04-28 09:15:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:00,223 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 09:15:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 09:15:00,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:00,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:00,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:00,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:00,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 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 09:15:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-28 09:15:00,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-28 09:15:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:00,226 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-28 09:15:00,226 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 09:15:00,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-28 09:15:00,240 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 09:15:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 09:15:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:15:00,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:00,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:00,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:15:00,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:00,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 1 times [2022-04-28 09:15:00,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:00,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1788384210] [2022-04-28 09:15:00,243 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:15:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 2 times [2022-04-28 09:15:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:00,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214591082] [2022-04-28 09:15:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:00,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:00,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:00,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(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(14, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-28 09:15:00,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 09:15:00,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-28 09:15:00,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:00,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(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(14, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-28 09:15:00,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 09:15:00,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-28 09:15:00,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret6 := main(); {142#true} is VALID [2022-04-28 09:15:00,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {147#(= main_~x~0 0)} is VALID [2022-04-28 09:15:00,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 99); {143#false} is VALID [2022-04-28 09:15:00,313 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {143#false} is VALID [2022-04-28 09:15:00,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-28 09:15:00,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-28 09:15:00,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-28 09:15:00,314 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 09:15:00,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:00,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214591082] [2022-04-28 09:15:00,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214591082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:00,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:00,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:15:00,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:00,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1788384210] [2022-04-28 09:15:00,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1788384210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:00,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:00,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:15:00,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081221678] [2022-04-28 09:15:00,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:00,318 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 09:15:00,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:00,319 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 09:15:00,330 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 09:15:00,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:15:00,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:00,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:15:00,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:15:00,333 INFO L87 Difference]: Start difference. First operand 13 states and 14 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 09:15:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:00,405 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 09:15:00,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:15:00,406 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 09:15:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:00,406 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 09:15:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-28 09:15:00,410 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 09:15:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-28 09:15:00,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-28 09:15:00,429 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 09:15:00,431 INFO L225 Difference]: With dead ends: 20 [2022-04-28 09:15:00,431 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:15:00,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:15:00,434 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:00,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:15:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:15:00,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-28 09:15:00,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:00,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:15:00,446 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:15:00,446 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:15:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:00,448 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 09:15:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 09:15:00,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:00,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:00,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:15:00,449 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:15:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:00,450 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 09:15:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 09:15:00,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:00,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:00,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:00,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:15:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-28 09:15:00,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-28 09:15:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:00,454 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-28 09:15:00,454 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 09:15:00,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-28 09:15:00,468 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 09:15:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 09:15:00,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:15:00,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:00,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:00,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:15:00,473 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:00,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:00,473 INFO L85 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 1 times [2022-04-28 09:15:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:00,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [321960144] [2022-04-28 09:15:00,492 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:00,492 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 2 times [2022-04-28 09:15:00,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:00,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513865687] [2022-04-28 09:15:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:00,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:00,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:00,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#(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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-28 09:15:00,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-28 09:15:00,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-28 09:15:00,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:00,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#(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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-28 09:15:00,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-28 09:15:00,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-28 09:15:00,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-28 09:15:00,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {256#(= main_~x~0 0)} is VALID [2022-04-28 09:15:00,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {256#(= main_~x~0 0)} is VALID [2022-04-28 09:15:00,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {257#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:00,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {252#false} is VALID [2022-04-28 09:15:00,591 INFO L272 TraceCheckUtils]: 9: Hoare triple {252#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {252#false} is VALID [2022-04-28 09:15:00,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-28 09:15:00,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-28 09:15:00,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-28 09:15:00,592 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 09:15:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:00,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513865687] [2022-04-28 09:15:00,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513865687] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:00,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839622338] [2022-04-28 09:15:00,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:15:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:00,594 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 09:15:00,595 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 09:15:00,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:15:00,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:00,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:15:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:00,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:00,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-28 09:15:00,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-28 09:15:00,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-28 09:15:00,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-28 09:15:00,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-28 09:15:00,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {256#(= main_~x~0 0)} is VALID [2022-04-28 09:15:00,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {256#(= main_~x~0 0)} is VALID [2022-04-28 09:15:00,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {283#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-28 09:15:00,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} assume !(~x~0 % 4294967296 < 99); {283#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-28 09:15:00,930 INFO L272 TraceCheckUtils]: 9: Hoare triple {283#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {290#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:00,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {290#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {294#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:00,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {252#false} is VALID [2022-04-28 09:15:00,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-28 09:15:00,931 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 09:15:00,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:01,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-28 09:15:01,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {252#false} is VALID [2022-04-28 09:15:01,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {290#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {294#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:01,217 INFO L272 TraceCheckUtils]: 9: Hoare triple {310#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {290#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:01,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {310#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:01,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {317#(<= 1 (mod (+ main_~x~0 1) 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {310#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:01,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {317#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {317#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:15:01,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {317#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:15:01,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-28 09:15:01,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-28 09:15:01,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-28 09:15:01,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-28 09:15:01,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-28 09:15:01,220 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 09:15:01,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839622338] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:01,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:01,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-04-28 09:15:01,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:01,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [321960144] [2022-04-28 09:15:01,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [321960144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:01,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:01,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:15:01,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454333175] [2022-04-28 09:15:01,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:01,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:01,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:01,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:01,231 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 09:15:01,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:15:01,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:01,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:15:01,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:15:01,232 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:01,288 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-28 09:15:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:15:01,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-28 09:15:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-28 09:15:01,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-28 09:15:01,308 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 09:15:01,308 INFO L225 Difference]: With dead ends: 22 [2022-04-28 09:15:01,308 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:15:01,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:15:01,309 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:01,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:15:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:15:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-28 09:15:01,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:01,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 09:15:01,314 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 09:15:01,314 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 09:15:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:01,315 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 09:15:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 09:15:01,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:01,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:01,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 17 states. [2022-04-28 09:15:01,315 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 17 states. [2022-04-28 09:15:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:01,316 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 09:15:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 09:15:01,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:01,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:01,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:01,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 09:15:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 09:15:01,317 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-04-28 09:15:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:01,318 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 09:15:01,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:01,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 09:15:01,331 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 09:15:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 09:15:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:15:01,332 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:01,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:01,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 09:15:01,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:01,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:01,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:01,545 INFO L85 PathProgramCache]: Analyzing trace with hash -454598811, now seen corresponding path program 1 times [2022-04-28 09:15:01,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:01,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1706540389] [2022-04-28 09:15:01,549 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:01,549 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:01,549 INFO L85 PathProgramCache]: Analyzing trace with hash -454598811, now seen corresponding path program 2 times [2022-04-28 09:15:01,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:01,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873370660] [2022-04-28 09:15:01,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:01,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:01,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:01,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {462#(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(14, 2);call #Ultimate.allocInit(12, 3); {455#true} is VALID [2022-04-28 09:15:01,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {455#true} assume true; {455#true} is VALID [2022-04-28 09:15:01,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {455#true} {455#true} #42#return; {455#true} is VALID [2022-04-28 09:15:01,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {455#true} call ULTIMATE.init(); {462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:01,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#(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(14, 2);call #Ultimate.allocInit(12, 3); {455#true} is VALID [2022-04-28 09:15:01,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {455#true} assume true; {455#true} is VALID [2022-04-28 09:15:01,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {455#true} {455#true} #42#return; {455#true} is VALID [2022-04-28 09:15:01,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {455#true} call #t~ret6 := main(); {455#true} is VALID [2022-04-28 09:15:01,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {455#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {460#(= main_~x~0 0)} is VALID [2022-04-28 09:15:01,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {460#(= main_~x~0 0)} is VALID [2022-04-28 09:15:01,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {461#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:01,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {461#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {456#false} is VALID [2022-04-28 09:15:01,603 INFO L272 TraceCheckUtils]: 9: Hoare triple {456#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {456#false} is VALID [2022-04-28 09:15:01,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#false} ~cond := #in~cond; {456#false} is VALID [2022-04-28 09:15:01,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {456#false} assume 0 == ~cond; {456#false} is VALID [2022-04-28 09:15:01,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {456#false} assume !false; {456#false} is VALID [2022-04-28 09:15:01,604 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 09:15:01,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:01,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873370660] [2022-04-28 09:15:01,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873370660] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:01,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968626496] [2022-04-28 09:15:01,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:15:01,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:01,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:01,628 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 09:15:01,629 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 09:15:01,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:15:01,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:01,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:15:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:01,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:01,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {455#true} call ULTIMATE.init(); {455#true} is VALID [2022-04-28 09:15:01,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {455#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(14, 2);call #Ultimate.allocInit(12, 3); {455#true} is VALID [2022-04-28 09:15:01,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {455#true} assume true; {455#true} is VALID [2022-04-28 09:15:01,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {455#true} {455#true} #42#return; {455#true} is VALID [2022-04-28 09:15:01,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {455#true} call #t~ret6 := main(); {455#true} is VALID [2022-04-28 09:15:01,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {455#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {460#(= main_~x~0 0)} is VALID [2022-04-28 09:15:01,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {460#(= main_~x~0 0)} is VALID [2022-04-28 09:15:01,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {487#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:15:01,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {487#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {487#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:15:01,875 INFO L272 TraceCheckUtils]: 9: Hoare triple {487#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:01,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:01,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {456#false} is VALID [2022-04-28 09:15:01,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {456#false} assume !false; {456#false} is VALID [2022-04-28 09:15:01,876 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 09:15:01,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:02,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {456#false} assume !false; {456#false} is VALID [2022-04-28 09:15:02,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {456#false} is VALID [2022-04-28 09:15:02,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:02,183 INFO L272 TraceCheckUtils]: 9: Hoare triple {514#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:02,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {514#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:02,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {521#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {514#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:02,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {521#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {521#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:02,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {455#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {521#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:02,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {455#true} call #t~ret6 := main(); {455#true} is VALID [2022-04-28 09:15:02,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {455#true} {455#true} #42#return; {455#true} is VALID [2022-04-28 09:15:02,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {455#true} assume true; {455#true} is VALID [2022-04-28 09:15:02,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {455#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(14, 2);call #Ultimate.allocInit(12, 3); {455#true} is VALID [2022-04-28 09:15:02,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {455#true} call ULTIMATE.init(); {455#true} is VALID [2022-04-28 09:15:02,188 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 09:15:02,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968626496] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:02,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:02,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-04-28 09:15:02,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:02,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1706540389] [2022-04-28 09:15:02,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1706540389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:02,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:02,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:15:02,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603564404] [2022-04-28 09:15:02,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:02,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:02,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:02,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:02,206 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 09:15:02,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:15:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:02,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:15:02,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:15:02,210 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:02,288 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 09:15:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:15:02,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-28 09:15:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-28 09:15:02,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-28 09:15:02,319 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 09:15:02,320 INFO L225 Difference]: With dead ends: 23 [2022-04-28 09:15:02,320 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 09:15:02,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:15:02,322 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:02,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 23 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:15:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 09:15:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-04-28 09:15:02,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:02,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 09:15:02,333 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 09:15:02,333 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 09:15:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:02,334 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-28 09:15:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 09:15:02,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:02,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:02,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 09:15:02,335 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 09:15:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:02,337 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-28 09:15:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 09:15:02,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:02,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:02,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:02,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 09:15:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 09:15:02,340 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-04-28 09:15:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:02,340 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 09:15:02,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 09:15:02,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 09:15:02,356 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 09:15:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 09:15:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:15:02,356 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:02,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:02,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:15:02,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 09:15:02,568 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:02,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:02,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1507084702, now seen corresponding path program 3 times [2022-04-28 09:15:02,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:02,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1317739056] [2022-04-28 09:15:02,582 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:02,582 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:02,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1507084702, now seen corresponding path program 4 times [2022-04-28 09:15:02,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:02,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692224103] [2022-04-28 09:15:02,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:02,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:02,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {671#(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(14, 2);call #Ultimate.allocInit(12, 3); {663#true} is VALID [2022-04-28 09:15:02,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#true} assume true; {663#true} is VALID [2022-04-28 09:15:02,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {663#true} {663#true} #42#return; {663#true} is VALID [2022-04-28 09:15:02,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {663#true} call ULTIMATE.init(); {671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:02,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#(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(14, 2);call #Ultimate.allocInit(12, 3); {663#true} is VALID [2022-04-28 09:15:02,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume true; {663#true} is VALID [2022-04-28 09:15:02,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} #42#return; {663#true} is VALID [2022-04-28 09:15:02,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {663#true} call #t~ret6 := main(); {663#true} is VALID [2022-04-28 09:15:02,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {668#(= main_~x~0 0)} is VALID [2022-04-28 09:15:02,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {668#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {668#(= main_~x~0 0)} is VALID [2022-04-28 09:15:02,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {668#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {669#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:02,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {669#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {669#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:02,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {669#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {670#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:02,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {670#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {664#false} is VALID [2022-04-28 09:15:02,686 INFO L272 TraceCheckUtils]: 11: Hoare triple {664#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {664#false} is VALID [2022-04-28 09:15:02,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#false} ~cond := #in~cond; {664#false} is VALID [2022-04-28 09:15:02,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#false} assume 0 == ~cond; {664#false} is VALID [2022-04-28 09:15:02,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#false} assume !false; {664#false} is VALID [2022-04-28 09:15:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:02,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:02,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692224103] [2022-04-28 09:15:02,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692224103] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:02,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861248731] [2022-04-28 09:15:02,687 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:15:02,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:02,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:02,691 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 09:15:02,694 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 09:15:02,747 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:15:02,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:02,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:15:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:02,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:02,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {663#true} call ULTIMATE.init(); {663#true} is VALID [2022-04-28 09:15:02,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#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(14, 2);call #Ultimate.allocInit(12, 3); {663#true} is VALID [2022-04-28 09:15:02,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume true; {663#true} is VALID [2022-04-28 09:15:02,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} #42#return; {663#true} is VALID [2022-04-28 09:15:02,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {663#true} call #t~ret6 := main(); {663#true} is VALID [2022-04-28 09:15:02,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {668#(= main_~x~0 0)} is VALID [2022-04-28 09:15:02,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {668#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {668#(= main_~x~0 0)} is VALID [2022-04-28 09:15:02,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {668#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {669#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:02,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {669#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {669#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:02,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {669#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {702#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:02,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {702#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {664#false} is VALID [2022-04-28 09:15:02,920 INFO L272 TraceCheckUtils]: 11: Hoare triple {664#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {664#false} is VALID [2022-04-28 09:15:02,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#false} ~cond := #in~cond; {664#false} is VALID [2022-04-28 09:15:02,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#false} assume 0 == ~cond; {664#false} is VALID [2022-04-28 09:15:02,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#false} assume !false; {664#false} is VALID [2022-04-28 09:15:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:02,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:02,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#false} assume !false; {664#false} is VALID [2022-04-28 09:15:02,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#false} assume 0 == ~cond; {664#false} is VALID [2022-04-28 09:15:02,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#false} ~cond := #in~cond; {664#false} is VALID [2022-04-28 09:15:02,976 INFO L272 TraceCheckUtils]: 11: Hoare triple {664#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {664#false} is VALID [2022-04-28 09:15:02,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {730#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {664#false} is VALID [2022-04-28 09:15:02,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {734#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {730#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:15:02,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {734#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {734#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-28 09:15:02,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {741#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {734#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-28 09:15:02,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {741#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {741#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:02,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {741#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:02,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {663#true} call #t~ret6 := main(); {663#true} is VALID [2022-04-28 09:15:02,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} #42#return; {663#true} is VALID [2022-04-28 09:15:02,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume true; {663#true} is VALID [2022-04-28 09:15:02,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#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(14, 2);call #Ultimate.allocInit(12, 3); {663#true} is VALID [2022-04-28 09:15:02,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {663#true} call ULTIMATE.init(); {663#true} is VALID [2022-04-28 09:15:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:02,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861248731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:02,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:02,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 09:15:02,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:02,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1317739056] [2022-04-28 09:15:02,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1317739056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:02,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:02,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:15:02,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852953868] [2022-04-28 09:15:02,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:02,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:02,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:02,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:03,003 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 09:15:03,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:15:03,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:03,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:15:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:15:03,003 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:03,087 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-28 09:15:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:15:03,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-28 09:15:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-28 09:15:03,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-28 09:15:03,111 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 09:15:03,112 INFO L225 Difference]: With dead ends: 25 [2022-04-28 09:15:03,112 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 09:15:03,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:15:03,113 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:03,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 18 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:15:03,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 09:15:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-28 09:15:03,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:03,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 09:15:03,134 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 09:15:03,134 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 09:15:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:03,135 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-28 09:15:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-28 09:15:03,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:03,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:03,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 09:15:03,135 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 09:15:03,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:03,136 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-28 09:15:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-28 09:15:03,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:03,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:03,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:03,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 09:15:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-28 09:15:03,137 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2022-04-28 09:15:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:03,137 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-28 09:15:03,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:03,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-28 09:15:03,158 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 09:15:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 09:15:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:15:03,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:03,159 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:03,191 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 09:15:03,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:03,377 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1449826400, now seen corresponding path program 1 times [2022-04-28 09:15:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:03,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1668516964] [2022-04-28 09:15:03,383 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:03,383 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:03,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1449826400, now seen corresponding path program 2 times [2022-04-28 09:15:03,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:03,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38411848] [2022-04-28 09:15:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:03,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:03,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:03,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {903#(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(14, 2);call #Ultimate.allocInit(12, 3); {897#true} is VALID [2022-04-28 09:15:03,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {897#true} assume true; {897#true} is VALID [2022-04-28 09:15:03,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {897#true} {897#true} #42#return; {897#true} is VALID [2022-04-28 09:15:03,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {897#true} call ULTIMATE.init(); {903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:03,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {903#(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(14, 2);call #Ultimate.allocInit(12, 3); {897#true} is VALID [2022-04-28 09:15:03,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {897#true} assume true; {897#true} is VALID [2022-04-28 09:15:03,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {897#true} {897#true} #42#return; {897#true} is VALID [2022-04-28 09:15:03,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {897#true} call #t~ret6 := main(); {897#true} is VALID [2022-04-28 09:15:03,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {897#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {897#true} is VALID [2022-04-28 09:15:03,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {897#true} assume !!(~x~0 % 4294967296 < 99); {897#true} is VALID [2022-04-28 09:15:03,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {897#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {902#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-28 09:15:03,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {902#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} assume !!(~x~0 % 4294967296 < 99); {902#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-28 09:15:03,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {902#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {898#false} is VALID [2022-04-28 09:15:03,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {898#false} assume !(~x~0 % 4294967296 < 99); {898#false} is VALID [2022-04-28 09:15:03,409 INFO L272 TraceCheckUtils]: 11: Hoare triple {898#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {898#false} is VALID [2022-04-28 09:15:03,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {898#false} ~cond := #in~cond; {898#false} is VALID [2022-04-28 09:15:03,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {898#false} assume 0 == ~cond; {898#false} is VALID [2022-04-28 09:15:03,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {898#false} assume !false; {898#false} is VALID [2022-04-28 09:15:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:03,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:03,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38411848] [2022-04-28 09:15:03,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38411848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:03,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:03,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:15:03,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:03,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1668516964] [2022-04-28 09:15:03,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1668516964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:03,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:03,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:15:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587251742] [2022-04-28 09:15:03,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:03,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:03,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,419 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 09:15:03,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:15:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:03,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:15:03,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:15:03,420 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:03,466 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 09:15:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:15:03,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-28 09:15:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-28 09:15:03,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-28 09:15:03,484 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 09:15:03,485 INFO L225 Difference]: With dead ends: 29 [2022-04-28 09:15:03,485 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 09:15:03,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:15:03,485 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:03,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:15:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 09:15:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 09:15:03,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:03,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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 09:15:03,498 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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 09:15:03,499 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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 09:15:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:03,499 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-28 09:15:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 09:15:03,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:03,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:03,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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 22 states. [2022-04-28 09:15:03,500 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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 22 states. [2022-04-28 09:15:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:03,501 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-28 09:15:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 09:15:03,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:03,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:03,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:03,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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 09:15:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-28 09:15:03,502 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-04-28 09:15:03,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:03,502 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-28 09:15:03,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-28 09:15:03,520 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 09:15:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 09:15:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:15:03,520 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:03,520 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:03,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 09:15:03,521 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:03,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:03,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1978535968, now seen corresponding path program 3 times [2022-04-28 09:15:03,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:03,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [697080252] [2022-04-28 09:15:03,526 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:03,526 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1978535968, now seen corresponding path program 4 times [2022-04-28 09:15:03,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:03,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409256627] [2022-04-28 09:15:03,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:03,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:03,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:03,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {1059#(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(14, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-28 09:15:03,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-28 09:15:03,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1053#true} {1053#true} #42#return; {1053#true} is VALID [2022-04-28 09:15:03,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1059#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:03,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {1059#(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(14, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-28 09:15:03,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-28 09:15:03,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #42#return; {1053#true} is VALID [2022-04-28 09:15:03,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret6 := main(); {1053#true} is VALID [2022-04-28 09:15:03,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1053#true} is VALID [2022-04-28 09:15:03,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {1053#true} assume !!(~x~0 % 4294967296 < 99); {1053#true} is VALID [2022-04-28 09:15:03,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {1053#true} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1058#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-28 09:15:03,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {1058#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 99); {1058#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-28 09:15:03,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {1058#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1054#false} is VALID [2022-04-28 09:15:03,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {1054#false} assume !(~x~0 % 4294967296 < 99); {1054#false} is VALID [2022-04-28 09:15:03,554 INFO L272 TraceCheckUtils]: 11: Hoare triple {1054#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1054#false} is VALID [2022-04-28 09:15:03,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2022-04-28 09:15:03,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2022-04-28 09:15:03,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-04-28 09:15:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:03,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:03,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409256627] [2022-04-28 09:15:03,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409256627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:03,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:03,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:15:03,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:03,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [697080252] [2022-04-28 09:15:03,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [697080252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:03,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:03,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:15:03,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686099442] [2022-04-28 09:15:03,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:03,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:03,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,565 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 09:15:03,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:15:03,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:03,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:15:03,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:15:03,566 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:03,611 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 09:15:03,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:15:03,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 09:15:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 09:15:03,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-28 09:15:03,630 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 09:15:03,631 INFO L225 Difference]: With dead ends: 29 [2022-04-28 09:15:03,631 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 09:15:03,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:15:03,631 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:03,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:15:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 09:15:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 09:15:03,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:03,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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 09:15:03,644 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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 09:15:03,644 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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 09:15:03,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:03,645 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 09:15:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-28 09:15:03,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:03,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:03,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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 22 states. [2022-04-28 09:15:03,645 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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 22 states. [2022-04-28 09:15:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:03,646 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 09:15:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-28 09:15:03,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:03,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:03,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:03,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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 09:15:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-28 09:15:03,647 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2022-04-28 09:15:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:03,647 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-28 09:15:03,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 09:15:03,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-28 09:15:03,665 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 09:15:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 09:15:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:15:03,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:03,684 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:03,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 09:15:03,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:03,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:03,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2035794270, now seen corresponding path program 3 times [2022-04-28 09:15:03,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:03,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715237378] [2022-04-28 09:15:03,687 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:03,687 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2035794270, now seen corresponding path program 4 times [2022-04-28 09:15:03,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:03,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507399759] [2022-04-28 09:15:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:03,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:03,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {1217#(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(14, 2);call #Ultimate.allocInit(12, 3); {1209#true} is VALID [2022-04-28 09:15:03,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {1209#true} assume true; {1209#true} is VALID [2022-04-28 09:15:03,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1209#true} {1209#true} #42#return; {1209#true} is VALID [2022-04-28 09:15:03,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {1209#true} call ULTIMATE.init(); {1217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:03,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {1217#(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(14, 2);call #Ultimate.allocInit(12, 3); {1209#true} is VALID [2022-04-28 09:15:03,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {1209#true} assume true; {1209#true} is VALID [2022-04-28 09:15:03,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1209#true} {1209#true} #42#return; {1209#true} is VALID [2022-04-28 09:15:03,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {1209#true} call #t~ret6 := main(); {1209#true} is VALID [2022-04-28 09:15:03,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {1209#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1214#(= main_~x~0 0)} is VALID [2022-04-28 09:15:03,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {1214#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1214#(= main_~x~0 0)} is VALID [2022-04-28 09:15:03,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {1214#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:03,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {1215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:03,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {1215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1216#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:03,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {1216#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {1210#false} is VALID [2022-04-28 09:15:03,741 INFO L272 TraceCheckUtils]: 11: Hoare triple {1210#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1210#false} is VALID [2022-04-28 09:15:03,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {1210#false} ~cond := #in~cond; {1210#false} is VALID [2022-04-28 09:15:03,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {1210#false} assume 0 == ~cond; {1210#false} is VALID [2022-04-28 09:15:03,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#false} assume !false; {1210#false} is VALID [2022-04-28 09:15:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:03,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:03,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507399759] [2022-04-28 09:15:03,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507399759] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:03,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814297669] [2022-04-28 09:15:03,742 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:15:03,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:03,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:03,743 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 09:15:03,779 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 09:15:03,785 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:15:03,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:03,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:15:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:03,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:03,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {1209#true} call ULTIMATE.init(); {1209#true} is VALID [2022-04-28 09:15:03,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {1209#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(14, 2);call #Ultimate.allocInit(12, 3); {1209#true} is VALID [2022-04-28 09:15:03,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {1209#true} assume true; {1209#true} is VALID [2022-04-28 09:15:03,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1209#true} {1209#true} #42#return; {1209#true} is VALID [2022-04-28 09:15:03,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {1209#true} call #t~ret6 := main(); {1209#true} is VALID [2022-04-28 09:15:03,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {1209#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1214#(= main_~x~0 0)} is VALID [2022-04-28 09:15:03,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {1214#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1214#(= main_~x~0 0)} is VALID [2022-04-28 09:15:03,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {1214#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1242#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:15:03,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {1242#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1242#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:15:03,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {1242#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1249#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:03,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {1249#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} assume !(~x~0 % 4294967296 < 99); {1249#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:03,970 INFO L272 TraceCheckUtils]: 11: Hoare triple {1249#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1256#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:03,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {1256#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1260#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:03,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {1260#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1210#false} is VALID [2022-04-28 09:15:03,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#false} assume !false; {1210#false} is VALID [2022-04-28 09:15:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:03,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:04,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#false} assume !false; {1210#false} is VALID [2022-04-28 09:15:04,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {1260#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1210#false} is VALID [2022-04-28 09:15:04,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {1256#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1260#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:04,222 INFO L272 TraceCheckUtils]: 11: Hoare triple {1276#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1256#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:04,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {1276#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {1276#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:04,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {1276#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1276#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:04,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {1276#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {1276#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:04,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {1289#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1276#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:04,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {1289#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {1289#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:04,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {1209#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1289#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:04,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {1209#true} call #t~ret6 := main(); {1209#true} is VALID [2022-04-28 09:15:04,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1209#true} {1209#true} #42#return; {1209#true} is VALID [2022-04-28 09:15:04,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {1209#true} assume true; {1209#true} is VALID [2022-04-28 09:15:04,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {1209#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(14, 2);call #Ultimate.allocInit(12, 3); {1209#true} is VALID [2022-04-28 09:15:04,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {1209#true} call ULTIMATE.init(); {1209#true} is VALID [2022-04-28 09:15:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:15:04,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814297669] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:04,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:04,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 12 [2022-04-28 09:15:04,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:04,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715237378] [2022-04-28 09:15:04,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715237378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:04,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:04,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:15:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083340210] [2022-04-28 09:15:04,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:04,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:04,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:04,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:04,240 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 09:15:04,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:15:04,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:04,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:15:04,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:15:04,241 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:04,355 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 09:15:04,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:15:04,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:04,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-28 09:15:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-28 09:15:04,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-28 09:15:04,376 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 09:15:04,377 INFO L225 Difference]: With dead ends: 29 [2022-04-28 09:15:04,377 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 09:15:04,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:15:04,378 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:04,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:15:04,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 09:15:04,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-28 09:15:04,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:04,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 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 09:15:04,395 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 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 09:15:04,395 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 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 09:15:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:04,396 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 09:15:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 09:15:04,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:04,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:04,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 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 24 states. [2022-04-28 09:15:04,397 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 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 24 states. [2022-04-28 09:15:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:04,397 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 09:15:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 09:15:04,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:04,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:04,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:04,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 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 09:15:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 09:15:04,398 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2022-04-28 09:15:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:04,398 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 09:15:04,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 09:15:04,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 09:15:04,421 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 09:15:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 09:15:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:15:04,422 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:04,422 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:04,440 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 09:15:04,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:04,638 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:04,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:04,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2003644377, now seen corresponding path program 5 times [2022-04-28 09:15:04,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:04,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [18349528] [2022-04-28 09:15:04,642 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:04,642 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2003644377, now seen corresponding path program 6 times [2022-04-28 09:15:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:04,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028103619] [2022-04-28 09:15:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:04,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {1480#(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(14, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-28 09:15:04,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-28 09:15:04,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1471#true} {1471#true} #42#return; {1471#true} is VALID [2022-04-28 09:15:04,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1480#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:04,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {1480#(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(14, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-28 09:15:04,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-28 09:15:04,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #42#return; {1471#true} is VALID [2022-04-28 09:15:04,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret6 := main(); {1471#true} is VALID [2022-04-28 09:15:04,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1476#(= main_~x~0 0)} is VALID [2022-04-28 09:15:04,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {1476#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1476#(= main_~x~0 0)} is VALID [2022-04-28 09:15:04,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {1476#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1477#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:04,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {1477#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {1477#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:04,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {1477#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:04,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {1478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:04,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {1478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1479#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 09:15:04,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {1479#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 99); {1472#false} is VALID [2022-04-28 09:15:04,710 INFO L272 TraceCheckUtils]: 13: Hoare triple {1472#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1472#false} is VALID [2022-04-28 09:15:04,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-04-28 09:15:04,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {1472#false} assume 0 == ~cond; {1472#false} is VALID [2022-04-28 09:15:04,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-28 09:15:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:04,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:04,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028103619] [2022-04-28 09:15:04,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028103619] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:04,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878827957] [2022-04-28 09:15:04,711 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:15:04,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:04,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:04,712 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 09:15:04,739 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 09:15:04,751 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 09:15:04,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:04,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:15:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:04,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:04,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-28 09:15:04,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#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(14, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-28 09:15:04,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-28 09:15:04,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #42#return; {1471#true} is VALID [2022-04-28 09:15:04,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret6 := main(); {1471#true} is VALID [2022-04-28 09:15:04,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1476#(= main_~x~0 0)} is VALID [2022-04-28 09:15:04,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {1476#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1476#(= main_~x~0 0)} is VALID [2022-04-28 09:15:04,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {1476#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1477#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:04,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {1477#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {1477#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:04,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {1477#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:04,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {1478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:04,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {1478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1517#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:15:04,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {1517#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {1472#false} is VALID [2022-04-28 09:15:04,907 INFO L272 TraceCheckUtils]: 13: Hoare triple {1472#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1472#false} is VALID [2022-04-28 09:15:04,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-04-28 09:15:04,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {1472#false} assume 0 == ~cond; {1472#false} is VALID [2022-04-28 09:15:04,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-28 09:15:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:04,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:04,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-28 09:15:04,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {1472#false} assume 0 == ~cond; {1472#false} is VALID [2022-04-28 09:15:04,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-04-28 09:15:04,989 INFO L272 TraceCheckUtils]: 13: Hoare triple {1472#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1472#false} is VALID [2022-04-28 09:15:04,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {1545#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {1472#false} is VALID [2022-04-28 09:15:04,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {1549#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1545#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:15:04,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {1549#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1549#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-28 09:15:04,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {1556#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1549#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-28 09:15:04,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {1556#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1556#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:04,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {1563#(< (mod (+ main_~x~0 3) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1556#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:04,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {1563#(< (mod (+ main_~x~0 3) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1563#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-28 09:15:04,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1563#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-28 09:15:04,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret6 := main(); {1471#true} is VALID [2022-04-28 09:15:04,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #42#return; {1471#true} is VALID [2022-04-28 09:15:04,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-28 09:15:04,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#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(14, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-28 09:15:04,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-28 09:15:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:04,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878827957] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:04,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:04,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 09:15:04,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:04,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [18349528] [2022-04-28 09:15:04,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [18349528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:04,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:04,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:15:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944686174] [2022-04-28 09:15:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:04,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:04,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:04,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:05,005 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 09:15:05,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:15:05,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:05,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:15:05,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:15:05,006 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:05,142 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 09:15:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:15:05,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-28 09:15:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-28 09:15:05,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2022-04-28 09:15:05,171 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 09:15:05,172 INFO L225 Difference]: With dead ends: 31 [2022-04-28 09:15:05,172 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 09:15:05,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 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 09:15:05,173 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:05,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 28 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:15:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 09:15:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 09:15:05,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:05,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 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 09:15:05,194 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 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 09:15:05,195 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 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 09:15:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:05,199 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 09:15:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 09:15:05,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:05,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:05,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 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 26 states. [2022-04-28 09:15:05,199 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 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 26 states. [2022-04-28 09:15:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:05,200 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 09:15:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 09:15:05,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:05,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:05,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:05,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 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 09:15:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 09:15:05,201 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2022-04-28 09:15:05,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:05,202 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 09:15:05,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:05,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 09:15:05,245 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 09:15:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 09:15:05,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:15:05,246 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:05,246 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:05,263 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 09:15:05,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:05,462 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:05,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1146207585, now seen corresponding path program 5 times [2022-04-28 09:15:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:05,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [136323524] [2022-04-28 09:15:05,465 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:05,465 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1146207585, now seen corresponding path program 6 times [2022-04-28 09:15:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:05,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395472550] [2022-04-28 09:15:05,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:05,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:05,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {1768#(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(14, 2);call #Ultimate.allocInit(12, 3); {1759#true} is VALID [2022-04-28 09:15:05,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {1759#true} assume true; {1759#true} is VALID [2022-04-28 09:15:05,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1759#true} {1759#true} #42#return; {1759#true} is VALID [2022-04-28 09:15:05,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {1759#true} call ULTIMATE.init(); {1768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:05,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {1768#(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(14, 2);call #Ultimate.allocInit(12, 3); {1759#true} is VALID [2022-04-28 09:15:05,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {1759#true} assume true; {1759#true} is VALID [2022-04-28 09:15:05,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1759#true} {1759#true} #42#return; {1759#true} is VALID [2022-04-28 09:15:05,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {1759#true} call #t~ret6 := main(); {1759#true} is VALID [2022-04-28 09:15:05,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {1759#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1764#(= main_~x~0 0)} is VALID [2022-04-28 09:15:05,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {1764#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1764#(= main_~x~0 0)} is VALID [2022-04-28 09:15:05,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {1764#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1765#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:05,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {1765#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1765#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:05,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {1765#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1766#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:05,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {1766#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1766#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:05,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {1766#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1767#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:05,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {1767#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 99); {1760#false} is VALID [2022-04-28 09:15:05,540 INFO L272 TraceCheckUtils]: 13: Hoare triple {1760#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1760#false} is VALID [2022-04-28 09:15:05,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {1760#false} ~cond := #in~cond; {1760#false} is VALID [2022-04-28 09:15:05,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {1760#false} assume 0 == ~cond; {1760#false} is VALID [2022-04-28 09:15:05,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {1760#false} assume !false; {1760#false} is VALID [2022-04-28 09:15:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:05,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:05,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395472550] [2022-04-28 09:15:05,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395472550] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:05,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352817698] [2022-04-28 09:15:05,540 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:15:05,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:05,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:05,555 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 09:15:05,591 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 09:15:05,620 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 09:15:05,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:05,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 09:15:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:05,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:06,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {1759#true} call ULTIMATE.init(); {1759#true} is VALID [2022-04-28 09:15:06,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {1759#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(14, 2);call #Ultimate.allocInit(12, 3); {1759#true} is VALID [2022-04-28 09:15:06,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {1759#true} assume true; {1759#true} is VALID [2022-04-28 09:15:06,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1759#true} {1759#true} #42#return; {1759#true} is VALID [2022-04-28 09:15:06,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {1759#true} call #t~ret6 := main(); {1759#true} is VALID [2022-04-28 09:15:06,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {1759#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1764#(= main_~x~0 0)} is VALID [2022-04-28 09:15:06,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {1764#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1764#(= main_~x~0 0)} is VALID [2022-04-28 09:15:06,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {1764#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1765#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:06,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {1765#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1765#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:06,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {1765#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1799#(and (<= main_~x~0 4) (<= (mod main_~y~0 2) 0) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:06,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {1799#(and (<= main_~x~0 4) (<= (mod main_~y~0 2) 0) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1799#(and (<= main_~x~0 4) (<= (mod main_~y~0 2) 0) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:06,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {1799#(and (<= main_~x~0 4) (<= (mod main_~y~0 2) 0) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1806#(and (<= 6 main_~x~0) (<= main_~x~0 6) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:06,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {1806#(and (<= 6 main_~x~0) (<= main_~x~0 6) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {1806#(and (<= 6 main_~x~0) (<= main_~x~0 6) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:06,061 INFO L272 TraceCheckUtils]: 13: Hoare triple {1806#(and (<= 6 main_~x~0) (<= main_~x~0 6) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1813#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:06,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {1813#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1817#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:06,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {1817#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1760#false} is VALID [2022-04-28 09:15:06,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {1760#false} assume !false; {1760#false} is VALID [2022-04-28 09:15:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:06,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:06,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {1760#false} assume !false; {1760#false} is VALID [2022-04-28 09:15:06,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {1817#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1760#false} is VALID [2022-04-28 09:15:06,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {1813#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1817#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:06,341 INFO L272 TraceCheckUtils]: 13: Hoare triple {1833#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1813#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:06,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {1833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {1833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:06,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {1833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:06,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {1833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {1833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:06,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {1846#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:06,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {1846#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {1846#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:06,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {1846#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1846#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:06,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {1846#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {1846#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:06,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {1759#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1846#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:06,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {1759#true} call #t~ret6 := main(); {1759#true} is VALID [2022-04-28 09:15:06,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1759#true} {1759#true} #42#return; {1759#true} is VALID [2022-04-28 09:15:06,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {1759#true} assume true; {1759#true} is VALID [2022-04-28 09:15:06,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {1759#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(14, 2);call #Ultimate.allocInit(12, 3); {1759#true} is VALID [2022-04-28 09:15:06,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {1759#true} call ULTIMATE.init(); {1759#true} is VALID [2022-04-28 09:15:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:15:06,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352817698] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:06,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:06,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 13 [2022-04-28 09:15:06,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:06,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [136323524] [2022-04-28 09:15:06,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [136323524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:06,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:06,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:15:06,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331394815] [2022-04-28 09:15:06,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:06,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:06,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:06,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:06,356 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 09:15:06,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:15:06,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:06,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:15:06,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:15:06,357 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:06,497 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 09:15:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:15:06,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-28 09:15:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-28 09:15:06,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2022-04-28 09:15:06,517 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 09:15:06,518 INFO L225 Difference]: With dead ends: 33 [2022-04-28 09:15:06,518 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 09:15:06,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:15:06,518 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:06,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:15:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 09:15:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-28 09:15:06,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:06,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 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 09:15:06,542 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 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 09:15:06,542 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 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 09:15:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:06,543 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-28 09:15:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 09:15:06,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:06,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:06,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 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 28 states. [2022-04-28 09:15:06,543 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 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 28 states. [2022-04-28 09:15:06,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:06,544 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-28 09:15:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 09:15:06,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:06,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:06,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:06,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 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 09:15:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-28 09:15:06,544 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 17 [2022-04-28 09:15:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:06,545 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-28 09:15:06,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 09:15:06,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-28 09:15:06,569 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 09:15:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 09:15:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 09:15:06,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:06,569 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:06,593 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 09:15:06,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:06,785 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:06,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:06,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1838845100, now seen corresponding path program 7 times [2022-04-28 09:15:06,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:06,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1188767671] [2022-04-28 09:15:06,788 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:06,788 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:06,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1838845100, now seen corresponding path program 8 times [2022-04-28 09:15:06,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:06,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367424820] [2022-04-28 09:15:06,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:06,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:06,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:06,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {2070#(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(14, 2);call #Ultimate.allocInit(12, 3); {2060#true} is VALID [2022-04-28 09:15:06,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {2060#true} assume true; {2060#true} is VALID [2022-04-28 09:15:06,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2060#true} {2060#true} #42#return; {2060#true} is VALID [2022-04-28 09:15:06,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {2060#true} call ULTIMATE.init(); {2070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:06,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#(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(14, 2);call #Ultimate.allocInit(12, 3); {2060#true} is VALID [2022-04-28 09:15:06,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {2060#true} assume true; {2060#true} is VALID [2022-04-28 09:15:06,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2060#true} {2060#true} #42#return; {2060#true} is VALID [2022-04-28 09:15:06,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {2060#true} call #t~ret6 := main(); {2060#true} is VALID [2022-04-28 09:15:06,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {2060#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2065#(= main_~x~0 0)} is VALID [2022-04-28 09:15:06,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {2065#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {2065#(= main_~x~0 0)} is VALID [2022-04-28 09:15:06,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2066#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:06,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {2066#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {2066#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:06,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {2066#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:06,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {2067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:06,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {2067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2068#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:15:06,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {2068#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2068#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:15:06,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {2068#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2069#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:06,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {2069#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {2061#false} is VALID [2022-04-28 09:15:06,876 INFO L272 TraceCheckUtils]: 15: Hoare triple {2061#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2061#false} is VALID [2022-04-28 09:15:06,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {2061#false} ~cond := #in~cond; {2061#false} is VALID [2022-04-28 09:15:06,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {2061#false} assume 0 == ~cond; {2061#false} is VALID [2022-04-28 09:15:06,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {2061#false} assume !false; {2061#false} is VALID [2022-04-28 09:15:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:06,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:06,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367424820] [2022-04-28 09:15:06,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367424820] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:06,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053134341] [2022-04-28 09:15:06,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:15:06,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:06,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:06,895 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 09:15:06,921 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 09:15:06,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:15:06,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:06,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 09:15:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:06,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:07,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {2060#true} call ULTIMATE.init(); {2060#true} is VALID [2022-04-28 09:15:07,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {2060#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(14, 2);call #Ultimate.allocInit(12, 3); {2060#true} is VALID [2022-04-28 09:15:07,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {2060#true} assume true; {2060#true} is VALID [2022-04-28 09:15:07,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2060#true} {2060#true} #42#return; {2060#true} is VALID [2022-04-28 09:15:07,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {2060#true} call #t~ret6 := main(); {2060#true} is VALID [2022-04-28 09:15:07,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {2060#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2065#(= main_~x~0 0)} is VALID [2022-04-28 09:15:07,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {2065#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {2065#(= main_~x~0 0)} is VALID [2022-04-28 09:15:07,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2066#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:07,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {2066#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {2066#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:07,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {2066#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:07,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {2067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:07,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {2067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2068#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:15:07,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {2068#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2068#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:15:07,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {2068#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2113#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:07,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {2113#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2061#false} is VALID [2022-04-28 09:15:07,128 INFO L272 TraceCheckUtils]: 15: Hoare triple {2061#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2061#false} is VALID [2022-04-28 09:15:07,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {2061#false} ~cond := #in~cond; {2061#false} is VALID [2022-04-28 09:15:07,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {2061#false} assume 0 == ~cond; {2061#false} is VALID [2022-04-28 09:15:07,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {2061#false} assume !false; {2061#false} is VALID [2022-04-28 09:15:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:07,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:07,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {2061#false} assume !false; {2061#false} is VALID [2022-04-28 09:15:07,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {2061#false} assume 0 == ~cond; {2061#false} is VALID [2022-04-28 09:15:07,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {2061#false} ~cond := #in~cond; {2061#false} is VALID [2022-04-28 09:15:07,229 INFO L272 TraceCheckUtils]: 15: Hoare triple {2061#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2061#false} is VALID [2022-04-28 09:15:07,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {2141#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {2061#false} is VALID [2022-04-28 09:15:07,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {2145#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2141#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:15:07,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {2145#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {2145#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-28 09:15:07,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {2152#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2145#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-28 09:15:07,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {2152#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {2152#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:07,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {2159#(< (mod (+ main_~x~0 3) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2152#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:07,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {2159#(< (mod (+ main_~x~0 3) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {2159#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-28 09:15:07,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {2166#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2159#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-28 09:15:07,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {2166#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {2166#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:07,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {2060#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2166#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:07,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {2060#true} call #t~ret6 := main(); {2060#true} is VALID [2022-04-28 09:15:07,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2060#true} {2060#true} #42#return; {2060#true} is VALID [2022-04-28 09:15:07,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {2060#true} assume true; {2060#true} is VALID [2022-04-28 09:15:07,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {2060#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(14, 2);call #Ultimate.allocInit(12, 3); {2060#true} is VALID [2022-04-28 09:15:07,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {2060#true} call ULTIMATE.init(); {2060#true} is VALID [2022-04-28 09:15:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:07,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053134341] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:07,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:07,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 09:15:07,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:07,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1188767671] [2022-04-28 09:15:07,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1188767671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:07,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:07,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:15:07,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688912119] [2022-04-28 09:15:07,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:07,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:07,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:07,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:07,249 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 09:15:07,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:15:07,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:07,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:15:07,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:15:07,249 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:07,424 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 09:15:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:15:07,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:07,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-28 09:15:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-28 09:15:07,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-28 09:15:07,449 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 09:15:07,449 INFO L225 Difference]: With dead ends: 35 [2022-04-28 09:15:07,449 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 09:15:07,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:15:07,450 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:07,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 18 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:15:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 09:15:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 09:15:07,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:07,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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 09:15:07,480 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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 09:15:07,480 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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 09:15:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:07,480 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 09:15:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 09:15:07,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:07,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:07,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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 30 states. [2022-04-28 09:15:07,481 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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 30 states. [2022-04-28 09:15:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:07,481 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 09:15:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 09:15:07,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:07,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:07,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:07,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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 09:15:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 09:15:07,482 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 19 [2022-04-28 09:15:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:07,483 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 09:15:07,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:07,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-28 09:15:07,511 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 09:15:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 09:15:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 09:15:07,512 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:07,512 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:07,536 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 09:15:07,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:07,724 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:07,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:07,724 INFO L85 PathProgramCache]: Analyzing trace with hash -951895204, now seen corresponding path program 7 times [2022-04-28 09:15:07,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:07,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2129292835] [2022-04-28 09:15:07,727 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:07,728 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:07,728 INFO L85 PathProgramCache]: Analyzing trace with hash -951895204, now seen corresponding path program 8 times [2022-04-28 09:15:07,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:07,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762776036] [2022-04-28 09:15:07,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:07,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:07,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:07,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {2398#(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(14, 2);call #Ultimate.allocInit(12, 3); {2388#true} is VALID [2022-04-28 09:15:07,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {2388#true} assume true; {2388#true} is VALID [2022-04-28 09:15:07,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2388#true} {2388#true} #42#return; {2388#true} is VALID [2022-04-28 09:15:07,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {2388#true} call ULTIMATE.init(); {2398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:07,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#(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(14, 2);call #Ultimate.allocInit(12, 3); {2388#true} is VALID [2022-04-28 09:15:07,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {2388#true} assume true; {2388#true} is VALID [2022-04-28 09:15:07,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2388#true} {2388#true} #42#return; {2388#true} is VALID [2022-04-28 09:15:07,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {2388#true} call #t~ret6 := main(); {2388#true} is VALID [2022-04-28 09:15:07,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {2388#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2393#(= main_~x~0 0)} is VALID [2022-04-28 09:15:07,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {2393#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {2393#(= main_~x~0 0)} is VALID [2022-04-28 09:15:07,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {2393#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2394#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:07,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {2394#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2394#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:07,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {2394#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2395#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:07,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {2395#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2395#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:07,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {2395#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2396#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:07,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {2396#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {2396#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:07,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {2396#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2397#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:07,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {2397#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {2389#false} is VALID [2022-04-28 09:15:07,796 INFO L272 TraceCheckUtils]: 15: Hoare triple {2389#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2389#false} is VALID [2022-04-28 09:15:07,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {2389#false} ~cond := #in~cond; {2389#false} is VALID [2022-04-28 09:15:07,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {2389#false} assume 0 == ~cond; {2389#false} is VALID [2022-04-28 09:15:07,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {2389#false} assume !false; {2389#false} is VALID [2022-04-28 09:15:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:07,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:07,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762776036] [2022-04-28 09:15:07,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762776036] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:07,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508269715] [2022-04-28 09:15:07,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:15:07,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:07,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:07,820 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 09:15:07,821 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 09:15:07,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:15:07,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:07,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 09:15:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:07,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:08,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {2388#true} call ULTIMATE.init(); {2388#true} is VALID [2022-04-28 09:15:08,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {2388#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(14, 2);call #Ultimate.allocInit(12, 3); {2388#true} is VALID [2022-04-28 09:15:08,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {2388#true} assume true; {2388#true} is VALID [2022-04-28 09:15:08,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2388#true} {2388#true} #42#return; {2388#true} is VALID [2022-04-28 09:15:08,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {2388#true} call #t~ret6 := main(); {2388#true} is VALID [2022-04-28 09:15:08,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {2388#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2393#(= main_~x~0 0)} is VALID [2022-04-28 09:15:08,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {2393#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {2393#(= main_~x~0 0)} is VALID [2022-04-28 09:15:08,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {2393#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2394#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:08,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {2394#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2394#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:08,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {2394#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2395#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:08,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {2395#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2395#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:08,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {2395#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2396#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:08,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {2396#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {2396#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:08,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {2396#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2441#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:08,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {2441#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2389#false} is VALID [2022-04-28 09:15:08,014 INFO L272 TraceCheckUtils]: 15: Hoare triple {2389#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2389#false} is VALID [2022-04-28 09:15:08,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {2389#false} ~cond := #in~cond; {2389#false} is VALID [2022-04-28 09:15:08,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {2389#false} assume 0 == ~cond; {2389#false} is VALID [2022-04-28 09:15:08,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {2389#false} assume !false; {2389#false} is VALID [2022-04-28 09:15:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:08,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:08,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {2389#false} assume !false; {2389#false} is VALID [2022-04-28 09:15:08,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {2389#false} assume 0 == ~cond; {2389#false} is VALID [2022-04-28 09:15:08,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {2389#false} ~cond := #in~cond; {2389#false} is VALID [2022-04-28 09:15:08,121 INFO L272 TraceCheckUtils]: 15: Hoare triple {2389#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2389#false} is VALID [2022-04-28 09:15:08,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {2469#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {2389#false} is VALID [2022-04-28 09:15:08,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {2473#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2469#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:15:08,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {2473#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {2473#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:08,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {2480#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2473#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:08,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {2480#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {2480#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:08,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {2487#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2480#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:08,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {2487#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {2487#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:15:08,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {2494#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2487#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:15:08,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {2494#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {2494#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:15:08,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {2388#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2494#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:15:08,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {2388#true} call #t~ret6 := main(); {2388#true} is VALID [2022-04-28 09:15:08,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2388#true} {2388#true} #42#return; {2388#true} is VALID [2022-04-28 09:15:08,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {2388#true} assume true; {2388#true} is VALID [2022-04-28 09:15:08,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {2388#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(14, 2);call #Ultimate.allocInit(12, 3); {2388#true} is VALID [2022-04-28 09:15:08,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {2388#true} call ULTIMATE.init(); {2388#true} is VALID [2022-04-28 09:15:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:08,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508269715] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:08,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:08,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 09:15:08,126 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:08,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2129292835] [2022-04-28 09:15:08,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2129292835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:08,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:08,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:15:08,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932830414] [2022-04-28 09:15:08,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:08,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:08,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:08,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:08,140 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 09:15:08,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:15:08,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:08,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:15:08,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:15:08,141 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:08,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:08,329 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 09:15:08,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:15:08,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-28 09:15:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-28 09:15:08,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-28 09:15:08,354 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 09:15:08,354 INFO L225 Difference]: With dead ends: 37 [2022-04-28 09:15:08,354 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 09:15:08,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:15:08,355 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:08,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:15:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 09:15:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-28 09:15:08,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:08,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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 09:15:08,393 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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 09:15:08,394 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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 09:15:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:08,394 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-28 09:15:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-28 09:15:08,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:08,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:08,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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 32 states. [2022-04-28 09:15:08,395 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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 32 states. [2022-04-28 09:15:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:08,395 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-28 09:15:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-28 09:15:08,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:08,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:08,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:08,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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 09:15:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-28 09:15:08,396 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 19 [2022-04-28 09:15:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:08,396 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-28 09:15:08,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 09:15:08,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-28 09:15:08,428 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 09:15:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 09:15:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 09:15:08,428 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:08,429 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:08,445 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 09:15:08,645 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,SelfDestructingSolverStorable11 [2022-04-28 09:15:08,645 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:08,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:08,645 INFO L85 PathProgramCache]: Analyzing trace with hash -799357937, now seen corresponding path program 9 times [2022-04-28 09:15:08,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:08,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624702877] [2022-04-28 09:15:08,656 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:08,656 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash -799357937, now seen corresponding path program 10 times [2022-04-28 09:15:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:08,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845769269] [2022-04-28 09:15:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:08,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {2739#(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(14, 2);call #Ultimate.allocInit(12, 3); {2728#true} is VALID [2022-04-28 09:15:08,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-04-28 09:15:08,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2728#true} {2728#true} #42#return; {2728#true} is VALID [2022-04-28 09:15:08,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {2728#true} call ULTIMATE.init(); {2739#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:08,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {2739#(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(14, 2);call #Ultimate.allocInit(12, 3); {2728#true} is VALID [2022-04-28 09:15:08,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-04-28 09:15:08,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2728#true} {2728#true} #42#return; {2728#true} is VALID [2022-04-28 09:15:08,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {2728#true} call #t~ret6 := main(); {2728#true} is VALID [2022-04-28 09:15:08,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {2728#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2733#(= main_~x~0 0)} is VALID [2022-04-28 09:15:08,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {2733#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {2733#(= main_~x~0 0)} is VALID [2022-04-28 09:15:08,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {2733#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2734#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:08,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {2734#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {2734#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:08,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {2734#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2735#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:08,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {2735#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2735#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:08,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {2735#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2736#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:15:08,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {2736#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2736#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:15:08,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {2736#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2737#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:08,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {2737#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2737#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:08,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {2737#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2738#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 09:15:08,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {2738#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 99); {2729#false} is VALID [2022-04-28 09:15:08,771 INFO L272 TraceCheckUtils]: 17: Hoare triple {2729#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2729#false} is VALID [2022-04-28 09:15:08,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {2729#false} ~cond := #in~cond; {2729#false} is VALID [2022-04-28 09:15:08,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {2729#false} assume 0 == ~cond; {2729#false} is VALID [2022-04-28 09:15:08,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {2729#false} assume !false; {2729#false} is VALID [2022-04-28 09:15:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:08,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:08,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845769269] [2022-04-28 09:15:08,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845769269] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:08,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066177766] [2022-04-28 09:15:08,787 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:15:08,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:08,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:08,788 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 09:15:08,801 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 09:15:08,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:15:08,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:08,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 09:15:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:08,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:09,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {2728#true} call ULTIMATE.init(); {2728#true} is VALID [2022-04-28 09:15:09,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {2728#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(14, 2);call #Ultimate.allocInit(12, 3); {2728#true} is VALID [2022-04-28 09:15:09,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-04-28 09:15:09,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2728#true} {2728#true} #42#return; {2728#true} is VALID [2022-04-28 09:15:09,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {2728#true} call #t~ret6 := main(); {2728#true} is VALID [2022-04-28 09:15:09,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {2728#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2733#(= main_~x~0 0)} is VALID [2022-04-28 09:15:09,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {2733#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {2733#(= main_~x~0 0)} is VALID [2022-04-28 09:15:09,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {2733#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2764#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} is VALID [2022-04-28 09:15:09,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {2764#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {2764#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} is VALID [2022-04-28 09:15:09,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {2764#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2771#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 2))} is VALID [2022-04-28 09:15:09,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {2771#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2771#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 2))} is VALID [2022-04-28 09:15:09,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {2771#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2778#(and (not (= (mod main_~y~0 2) 0)) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-28 09:15:09,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {2778#(and (not (= (mod main_~y~0 2) 0)) (= (+ (- 1) main_~x~0) 2))} assume !!(~x~0 % 4294967296 < 99); {2778#(and (not (= (mod main_~y~0 2) 0)) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-28 09:15:09,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {2778#(and (not (= (mod main_~y~0 2) 0)) (= (+ (- 1) main_~x~0) 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2785#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 4))} is VALID [2022-04-28 09:15:09,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {2785#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2785#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 4))} is VALID [2022-04-28 09:15:09,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {2785#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2792#(and (not (= (mod main_~y~0 2) 0)) (= 5 main_~x~0))} is VALID [2022-04-28 09:15:09,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {2792#(and (not (= (mod main_~y~0 2) 0)) (= 5 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2792#(and (not (= (mod main_~y~0 2) 0)) (= 5 main_~x~0))} is VALID [2022-04-28 09:15:09,056 INFO L272 TraceCheckUtils]: 17: Hoare triple {2792#(and (not (= (mod main_~y~0 2) 0)) (= 5 main_~x~0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2799#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:09,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {2799#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2803#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:09,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {2803#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2729#false} is VALID [2022-04-28 09:15:09,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {2729#false} assume !false; {2729#false} is VALID [2022-04-28 09:15:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:09,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:09,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {2729#false} assume !false; {2729#false} is VALID [2022-04-28 09:15:09,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {2803#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2729#false} is VALID [2022-04-28 09:15:09,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {2799#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2803#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:09,307 INFO L272 TraceCheckUtils]: 17: Hoare triple {2819#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2799#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:09,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {2819#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {2819#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:09,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {2826#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2819#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:09,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {2826#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {2826#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:15:09,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {2819#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2826#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:15:09,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {2819#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {2819#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:09,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {2826#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2819#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:09,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {2826#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {2826#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:15:09,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {2819#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2826#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:15:09,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {2819#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {2819#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:09,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {2851#(<= 1 (mod (+ main_~x~0 1) 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2819#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:09,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {2851#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {2851#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:15:09,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {2728#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2851#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-28 09:15:09,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {2728#true} call #t~ret6 := main(); {2728#true} is VALID [2022-04-28 09:15:09,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2728#true} {2728#true} #42#return; {2728#true} is VALID [2022-04-28 09:15:09,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-04-28 09:15:09,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {2728#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(14, 2);call #Ultimate.allocInit(12, 3); {2728#true} is VALID [2022-04-28 09:15:09,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {2728#true} call ULTIMATE.init(); {2728#true} is VALID [2022-04-28 09:15:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 09:15:09,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066177766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:09,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:09,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 19 [2022-04-28 09:15:09,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:09,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1624702877] [2022-04-28 09:15:09,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1624702877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:09,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:09,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:15:09,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550418715] [2022-04-28 09:15:09,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:09,313 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:09,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:09,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:09,322 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 09:15:09,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:15:09,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:09,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:15:09,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:15:09,323 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:09,509 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-28 09:15:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:15:09,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-28 09:15:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-28 09:15:09,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-28 09:15:09,528 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 09:15:09,528 INFO L225 Difference]: With dead ends: 39 [2022-04-28 09:15:09,528 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 09:15:09,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-04-28 09:15:09,529 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:09,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 28 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:15:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 09:15:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-28 09:15:09,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:09,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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 09:15:09,565 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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 09:15:09,566 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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 09:15:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:09,567 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 09:15:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 09:15:09,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:09,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:09,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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 34 states. [2022-04-28 09:15:09,567 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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 34 states. [2022-04-28 09:15:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:09,584 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 09:15:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 09:15:09,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:09,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:09,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:09,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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 09:15:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 09:15:09,586 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 21 [2022-04-28 09:15:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:09,586 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 09:15:09,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:09,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 09:15:09,612 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 09:15:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 09:15:09,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 09:15:09,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:09,613 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:09,637 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 09:15:09,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 09:15:09,813 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:09,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1098709209, now seen corresponding path program 9 times [2022-04-28 09:15:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:09,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1916404532] [2022-04-28 09:15:09,816 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:09,816 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1098709209, now seen corresponding path program 10 times [2022-04-28 09:15:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:09,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603487533] [2022-04-28 09:15:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:09,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:09,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {3110#(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(14, 2);call #Ultimate.allocInit(12, 3); {3099#true} is VALID [2022-04-28 09:15:09,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {3099#true} assume true; {3099#true} is VALID [2022-04-28 09:15:09,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3099#true} {3099#true} #42#return; {3099#true} is VALID [2022-04-28 09:15:09,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {3099#true} call ULTIMATE.init(); {3110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:09,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {3110#(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(14, 2);call #Ultimate.allocInit(12, 3); {3099#true} is VALID [2022-04-28 09:15:09,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {3099#true} assume true; {3099#true} is VALID [2022-04-28 09:15:09,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3099#true} {3099#true} #42#return; {3099#true} is VALID [2022-04-28 09:15:09,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {3099#true} call #t~ret6 := main(); {3099#true} is VALID [2022-04-28 09:15:09,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {3099#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3104#(= main_~x~0 0)} is VALID [2022-04-28 09:15:09,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {3104#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {3104#(= main_~x~0 0)} is VALID [2022-04-28 09:15:09,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {3104#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3105#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:09,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {3105#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3105#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:09,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {3105#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3106#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:09,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {3106#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3106#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:09,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {3106#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3107#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:09,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {3107#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {3107#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:09,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {3107#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3108#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:09,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {3108#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3108#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:09,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {3108#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3109#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:09,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {3109#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {3100#false} is VALID [2022-04-28 09:15:09,906 INFO L272 TraceCheckUtils]: 17: Hoare triple {3100#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3100#false} is VALID [2022-04-28 09:15:09,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {3100#false} ~cond := #in~cond; {3100#false} is VALID [2022-04-28 09:15:09,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {3100#false} assume 0 == ~cond; {3100#false} is VALID [2022-04-28 09:15:09,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {3100#false} assume !false; {3100#false} is VALID [2022-04-28 09:15:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:09,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:09,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603487533] [2022-04-28 09:15:09,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603487533] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:09,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592829820] [2022-04-28 09:15:09,907 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:15:09,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:09,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:09,908 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 09:15:09,946 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 09:15:09,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:15:09,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:09,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 09:15:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:09,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:10,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {3099#true} call ULTIMATE.init(); {3099#true} is VALID [2022-04-28 09:15:10,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {3099#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(14, 2);call #Ultimate.allocInit(12, 3); {3099#true} is VALID [2022-04-28 09:15:10,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {3099#true} assume true; {3099#true} is VALID [2022-04-28 09:15:10,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3099#true} {3099#true} #42#return; {3099#true} is VALID [2022-04-28 09:15:10,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {3099#true} call #t~ret6 := main(); {3099#true} is VALID [2022-04-28 09:15:10,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {3099#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3104#(= main_~x~0 0)} is VALID [2022-04-28 09:15:10,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {3104#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {3104#(= main_~x~0 0)} is VALID [2022-04-28 09:15:10,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {3104#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3135#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:15:10,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {3135#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3135#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:15:10,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {3135#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3142#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:10,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {3142#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {3142#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:10,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {3142#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3149#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:15:10,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {3149#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {3149#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:15:10,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {3149#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3156#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:15:10,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {3156#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3156#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:15:10,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {3156#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3163#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:10,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {3163#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {3163#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:10,220 INFO L272 TraceCheckUtils]: 17: Hoare triple {3163#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3170#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:10,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {3170#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3174#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:10,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {3174#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3100#false} is VALID [2022-04-28 09:15:10,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {3100#false} assume !false; {3100#false} is VALID [2022-04-28 09:15:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:10,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:10,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {3100#false} assume !false; {3100#false} is VALID [2022-04-28 09:15:10,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {3174#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3100#false} is VALID [2022-04-28 09:15:10,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {3170#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3174#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:10,549 INFO L272 TraceCheckUtils]: 17: Hoare triple {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3170#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:10,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:10,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:10,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:10,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:10,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:10,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:10,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:10,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:10,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:10,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {3221#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3190#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:10,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {3221#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {3221#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:10,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {3099#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3221#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:10,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {3099#true} call #t~ret6 := main(); {3099#true} is VALID [2022-04-28 09:15:10,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3099#true} {3099#true} #42#return; {3099#true} is VALID [2022-04-28 09:15:10,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {3099#true} assume true; {3099#true} is VALID [2022-04-28 09:15:10,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {3099#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(14, 2);call #Ultimate.allocInit(12, 3); {3099#true} is VALID [2022-04-28 09:15:10,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {3099#true} call ULTIMATE.init(); {3099#true} is VALID [2022-04-28 09:15:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 09:15:10,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592829820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:10,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:10,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 6] total 18 [2022-04-28 09:15:10,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:10,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1916404532] [2022-04-28 09:15:10,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1916404532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:10,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:10,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:15:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248831383] [2022-04-28 09:15:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:10,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:10,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:10,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:10,574 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 09:15:10,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:15:10,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:10,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:15:10,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:15:10,574 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:10,842 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-28 09:15:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:15:10,843 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-28 09:15:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-28 09:15:10,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 33 transitions. [2022-04-28 09:15:10,870 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 09:15:10,870 INFO L225 Difference]: With dead ends: 41 [2022-04-28 09:15:10,870 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 09:15:10,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:15:10,871 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:10,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:15:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 09:15:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-28 09:15:10,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:10,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 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 09:15:10,918 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 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 09:15:10,918 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 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 09:15:10,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:10,918 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 09:15:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 09:15:10,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:10,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:10,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 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 36 states. [2022-04-28 09:15:10,919 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 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 36 states. [2022-04-28 09:15:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:10,920 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 09:15:10,920 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 09:15:10,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:10,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:10,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:10,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 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 09:15:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-28 09:15:10,921 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 21 [2022-04-28 09:15:10,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:10,921 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-28 09:15:10,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 09:15:10,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-28 09:15:10,957 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 09:15:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 09:15:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 09:15:10,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:10,958 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:10,974 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 09:15:11,167 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,SelfDestructingSolverStorable13 [2022-04-28 09:15:11,168 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:11,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1715393034, now seen corresponding path program 11 times [2022-04-28 09:15:11,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:11,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [867985370] [2022-04-28 09:15:11,170 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:11,170 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1715393034, now seen corresponding path program 12 times [2022-04-28 09:15:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:11,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812733198] [2022-04-28 09:15:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:11,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:11,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:11,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {3493#(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(14, 2);call #Ultimate.allocInit(12, 3); {3481#true} is VALID [2022-04-28 09:15:11,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {3481#true} assume true; {3481#true} is VALID [2022-04-28 09:15:11,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3481#true} {3481#true} #42#return; {3481#true} is VALID [2022-04-28 09:15:11,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {3481#true} call ULTIMATE.init(); {3493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:11,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {3493#(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(14, 2);call #Ultimate.allocInit(12, 3); {3481#true} is VALID [2022-04-28 09:15:11,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {3481#true} assume true; {3481#true} is VALID [2022-04-28 09:15:11,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3481#true} {3481#true} #42#return; {3481#true} is VALID [2022-04-28 09:15:11,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {3481#true} call #t~ret6 := main(); {3481#true} is VALID [2022-04-28 09:15:11,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {3481#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3486#(= main_~x~0 0)} is VALID [2022-04-28 09:15:11,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {3486#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {3486#(= main_~x~0 0)} is VALID [2022-04-28 09:15:11,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {3486#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:11,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {3487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {3487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:15:11,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {3487#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:11,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {3488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:11,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {3488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3489#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:15:11,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {3489#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3489#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:15:11,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {3489#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3490#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:11,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {3490#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3490#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:11,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {3490#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3491#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:15:11,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {3491#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {3491#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:15:11,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {3491#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3492#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:11,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {3492#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 99); {3482#false} is VALID [2022-04-28 09:15:11,287 INFO L272 TraceCheckUtils]: 19: Hoare triple {3482#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3482#false} is VALID [2022-04-28 09:15:11,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {3482#false} ~cond := #in~cond; {3482#false} is VALID [2022-04-28 09:15:11,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {3482#false} assume 0 == ~cond; {3482#false} is VALID [2022-04-28 09:15:11,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {3482#false} assume !false; {3482#false} is VALID [2022-04-28 09:15:11,287 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 09:15:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:11,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812733198] [2022-04-28 09:15:11,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812733198] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:11,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476186460] [2022-04-28 09:15:11,288 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:15:11,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:11,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:11,302 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 09:15:11,336 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 09:15:11,352 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 09:15:11,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:11,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:15:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:11,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:12,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {3481#true} call ULTIMATE.init(); {3481#true} is VALID [2022-04-28 09:15:12,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {3481#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(14, 2);call #Ultimate.allocInit(12, 3); {3481#true} is VALID [2022-04-28 09:15:12,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {3481#true} assume true; {3481#true} is VALID [2022-04-28 09:15:12,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3481#true} {3481#true} #42#return; {3481#true} is VALID [2022-04-28 09:15:12,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {3481#true} call #t~ret6 := main(); {3481#true} is VALID [2022-04-28 09:15:12,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {3481#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3481#true} is VALID [2022-04-28 09:15:12,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {3481#true} assume !!(~x~0 % 4294967296 < 99); {3481#true} is VALID [2022-04-28 09:15:12,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {3481#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3481#true} is VALID [2022-04-28 09:15:12,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {3481#true} assume !!(~x~0 % 4294967296 < 99); {3481#true} is VALID [2022-04-28 09:15:12,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {3481#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3481#true} is VALID [2022-04-28 09:15:12,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {3481#true} assume !!(~x~0 % 4294967296 < 99); {3481#true} is VALID [2022-04-28 09:15:12,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {3481#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3530#(not (= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:12,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {3530#(not (= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3530#(not (= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:12,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {3530#(not (= (mod main_~y~0 2) 0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3530#(not (= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:12,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {3530#(not (= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3530#(not (= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:12,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {3530#(not (= (mod main_~y~0 2) 0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3530#(not (= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:12,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {3530#(not (= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3546#(and (not (= (mod main_~y~0 2) 0)) (< (mod main_~x~0 4294967296) 99))} is VALID [2022-04-28 09:15:12,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {3546#(and (not (= (mod main_~y~0 2) 0)) (< (mod main_~x~0 4294967296) 99))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3550#(and (not (= (mod main_~y~0 2) 0)) (< (mod (+ main_~x~0 4294967295) 4294967296) 99))} is VALID [2022-04-28 09:15:12,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {3550#(and (not (= (mod main_~y~0 2) 0)) (< (mod (+ main_~x~0 4294967295) 4294967296) 99))} assume !(~x~0 % 4294967296 < 99); {3554#(and (not (= (mod main_~y~0 2) 0)) (< (mod (+ main_~x~0 4294967295) 4294967296) 99) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-28 09:15:12,062 INFO L272 TraceCheckUtils]: 19: Hoare triple {3554#(and (not (= (mod main_~y~0 2) 0)) (< (mod (+ main_~x~0 4294967295) 4294967296) 99) (not (< (mod main_~x~0 4294967296) 99)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3558#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:12,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {3558#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3562#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:12,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {3562#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3482#false} is VALID [2022-04-28 09:15:12,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {3482#false} assume !false; {3482#false} is VALID [2022-04-28 09:15:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 09:15:12,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:15:12,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476186460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:12,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:15:12,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-04-28 09:15:12,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:12,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [867985370] [2022-04-28 09:15:12,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [867985370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:12,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:12,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:15:12,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271359164] [2022-04-28 09:15:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:12,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 09:15:12,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:12,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:15:12,079 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 09:15:12,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:15:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:12,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:15:12,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:15:12,079 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:15:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:12,263 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 09:15:12,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:15:12,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 09:15:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:15:12,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 09:15:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:15:12,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 09:15:12,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-28 09:15:12,326 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 09:15:12,327 INFO L225 Difference]: With dead ends: 40 [2022-04-28 09:15:12,327 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 09:15:12,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:15:12,328 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:12,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:15:12,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 09:15:12,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 09:15:12,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:12,349 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 09:15:12,350 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 09:15:12,350 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 09:15:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:12,350 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 09:15:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 09:15:12,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:12,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:12,351 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 09:15:12,351 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 09:15:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:12,351 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 09:15:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 09:15:12,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:12,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:12,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:12,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:12,352 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 09:15:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-28 09:15:12,352 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 23 [2022-04-28 09:15:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:12,352 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-28 09:15:12,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:15:12,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-28 09:15:12,374 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 09:15:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 09:15:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 09:15:12,375 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:12,375 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:12,395 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 09:15:12,575 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,SelfDestructingSolverStorable14 [2022-04-28 09:15:12,575 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash 339561238, now seen corresponding path program 11 times [2022-04-28 09:15:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:12,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1410939951] [2022-04-28 09:15:12,579 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:12,579 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash 339561238, now seen corresponding path program 12 times [2022-04-28 09:15:12,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:12,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426088793] [2022-04-28 09:15:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:12,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:12,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {3760#(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(14, 2);call #Ultimate.allocInit(12, 3); {3748#true} is VALID [2022-04-28 09:15:12,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {3748#true} assume true; {3748#true} is VALID [2022-04-28 09:15:12,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3748#true} {3748#true} #42#return; {3748#true} is VALID [2022-04-28 09:15:12,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {3748#true} call ULTIMATE.init(); {3760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:12,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {3760#(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(14, 2);call #Ultimate.allocInit(12, 3); {3748#true} is VALID [2022-04-28 09:15:12,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {3748#true} assume true; {3748#true} is VALID [2022-04-28 09:15:12,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3748#true} {3748#true} #42#return; {3748#true} is VALID [2022-04-28 09:15:12,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {3748#true} call #t~ret6 := main(); {3748#true} is VALID [2022-04-28 09:15:12,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {3748#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3753#(= main_~x~0 0)} is VALID [2022-04-28 09:15:12,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {3753#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {3753#(= main_~x~0 0)} is VALID [2022-04-28 09:15:12,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {3753#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:12,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {3754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:12,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {3754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:12,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {3755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:12,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {3755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:12,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {3756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {3756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:12,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {3756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:12,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {3757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:12,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {3757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:12,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {3758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:12,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {3758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3759#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:12,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {3759#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {3749#false} is VALID [2022-04-28 09:15:12,702 INFO L272 TraceCheckUtils]: 19: Hoare triple {3749#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3749#false} is VALID [2022-04-28 09:15:12,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {3749#false} ~cond := #in~cond; {3749#false} is VALID [2022-04-28 09:15:12,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {3749#false} assume 0 == ~cond; {3749#false} is VALID [2022-04-28 09:15:12,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {3749#false} assume !false; {3749#false} is VALID [2022-04-28 09:15:12,703 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 09:15:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:12,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426088793] [2022-04-28 09:15:12,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426088793] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:12,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742255160] [2022-04-28 09:15:12,703 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:15:12,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:12,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:12,704 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 09:15:12,705 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 09:15:12,739 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 09:15:12,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:12,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 09:15:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:12,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:12,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {3748#true} call ULTIMATE.init(); {3748#true} is VALID [2022-04-28 09:15:12,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {3748#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(14, 2);call #Ultimate.allocInit(12, 3); {3748#true} is VALID [2022-04-28 09:15:12,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {3748#true} assume true; {3748#true} is VALID [2022-04-28 09:15:12,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3748#true} {3748#true} #42#return; {3748#true} is VALID [2022-04-28 09:15:12,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {3748#true} call #t~ret6 := main(); {3748#true} is VALID [2022-04-28 09:15:12,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {3748#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3753#(= main_~x~0 0)} is VALID [2022-04-28 09:15:12,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {3753#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {3753#(= main_~x~0 0)} is VALID [2022-04-28 09:15:12,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {3753#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:12,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {3754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:12,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {3754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:12,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {3755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:12,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {3755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:12,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {3756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {3756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:12,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {3756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:12,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {3757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:12,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {3757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:12,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {3758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:12,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {3758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3815#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:12,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {3815#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {3749#false} is VALID [2022-04-28 09:15:12,941 INFO L272 TraceCheckUtils]: 19: Hoare triple {3749#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3749#false} is VALID [2022-04-28 09:15:12,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {3749#false} ~cond := #in~cond; {3749#false} is VALID [2022-04-28 09:15:12,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {3749#false} assume 0 == ~cond; {3749#false} is VALID [2022-04-28 09:15:12,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {3749#false} assume !false; {3749#false} is VALID [2022-04-28 09:15:12,941 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 09:15:12,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:13,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {3749#false} assume !false; {3749#false} is VALID [2022-04-28 09:15:13,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {3749#false} assume 0 == ~cond; {3749#false} is VALID [2022-04-28 09:15:13,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {3749#false} ~cond := #in~cond; {3749#false} is VALID [2022-04-28 09:15:13,096 INFO L272 TraceCheckUtils]: 19: Hoare triple {3749#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3749#false} is VALID [2022-04-28 09:15:13,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {3843#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {3749#false} is VALID [2022-04-28 09:15:13,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {3847#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3843#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:15:13,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {3847#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {3847#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:13,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {3854#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3847#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:13,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {3854#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {3854#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:13,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {3861#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3854#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:13,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {3861#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {3861#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:15:13,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {3868#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3861#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:15:13,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {3868#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {3868#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:15:13,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {3875#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3868#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:15:13,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {3875#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {3875#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:15:13,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {3882#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3875#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:15:13,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {3882#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {3882#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:15:13,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {3748#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3882#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:15:13,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {3748#true} call #t~ret6 := main(); {3748#true} is VALID [2022-04-28 09:15:13,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3748#true} {3748#true} #42#return; {3748#true} is VALID [2022-04-28 09:15:13,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {3748#true} assume true; {3748#true} is VALID [2022-04-28 09:15:13,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {3748#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(14, 2);call #Ultimate.allocInit(12, 3); {3748#true} is VALID [2022-04-28 09:15:13,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {3748#true} call ULTIMATE.init(); {3748#true} is VALID [2022-04-28 09:15:13,110 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 09:15:13,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742255160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:13,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:13,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 09:15:13,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:13,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1410939951] [2022-04-28 09:15:13,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1410939951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:13,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:13,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:15:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271474006] [2022-04-28 09:15:13,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:13,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 09:15:13,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:13,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 09:15:13,126 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 09:15:13,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:15:13,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:15:13,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:15:13,127 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 09:15:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:13,369 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 09:15:13,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:15:13,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 09:15:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 09:15:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-28 09:15:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 09:15:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-28 09:15:13,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-28 09:15:13,399 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 09:15:13,399 INFO L225 Difference]: With dead ends: 32 [2022-04-28 09:15:13,399 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 09:15:13,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 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 09:15:13,400 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:13,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 28 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:15:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 09:15:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 09:15:13,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:13,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 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 09:15:13,445 INFO L74 IsIncluded]: Start isIncluded. First operand 27 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 09:15:13,446 INFO L87 Difference]: Start difference. First operand 27 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 09:15:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:13,446 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 09:15:13,446 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 09:15:13,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:13,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:13,446 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 27 states. [2022-04-28 09:15:13,447 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 27 states. [2022-04-28 09:15:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:13,447 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 09:15:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 09:15:13,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:13,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:13,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:13,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:13,448 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 09:15:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-28 09:15:13,449 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2022-04-28 09:15:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:13,449 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-28 09:15:13,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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 09:15:13,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-28 09:15:13,478 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 09:15:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 09:15:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 09:15:13,479 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:13,479 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:13,501 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 09:15:13,679 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,SelfDestructingSolverStorable15 [2022-04-28 09:15:13,680 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 942801427, now seen corresponding path program 13 times [2022-04-28 09:15:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:13,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038245699] [2022-04-28 09:15:13,682 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:13,682 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash 942801427, now seen corresponding path program 14 times [2022-04-28 09:15:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:13,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071866246] [2022-04-28 09:15:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:13,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:13,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {4103#(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(14, 2);call #Ultimate.allocInit(12, 3); {4090#true} is VALID [2022-04-28 09:15:13,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {4090#true} assume true; {4090#true} is VALID [2022-04-28 09:15:13,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4090#true} {4090#true} #42#return; {4090#true} is VALID [2022-04-28 09:15:13,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {4090#true} call ULTIMATE.init(); {4103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:13,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {4103#(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(14, 2);call #Ultimate.allocInit(12, 3); {4090#true} is VALID [2022-04-28 09:15:13,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {4090#true} assume true; {4090#true} is VALID [2022-04-28 09:15:13,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4090#true} {4090#true} #42#return; {4090#true} is VALID [2022-04-28 09:15:13,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {4090#true} call #t~ret6 := main(); {4090#true} is VALID [2022-04-28 09:15:13,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {4090#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4095#(= main_~x~0 0)} is VALID [2022-04-28 09:15:13,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {4095#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {4095#(= main_~x~0 0)} is VALID [2022-04-28 09:15:13,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {4095#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4096#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:13,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {4096#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4096#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:13,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {4096#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4097#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:13,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {4097#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4097#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:13,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {4097#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4098#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:13,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {4098#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {4098#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:13,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {4098#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4099#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:13,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {4099#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4099#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:13,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {4099#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4100#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:13,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {4100#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4100#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:13,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {4100#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4101#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:13,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {4101#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4101#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:13,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {4101#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4102#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:13,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {4102#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {4091#false} is VALID [2022-04-28 09:15:13,841 INFO L272 TraceCheckUtils]: 21: Hoare triple {4091#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4091#false} is VALID [2022-04-28 09:15:13,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {4091#false} ~cond := #in~cond; {4091#false} is VALID [2022-04-28 09:15:13,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {4091#false} assume 0 == ~cond; {4091#false} is VALID [2022-04-28 09:15:13,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {4091#false} assume !false; {4091#false} is VALID [2022-04-28 09:15:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:13,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:13,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071866246] [2022-04-28 09:15:13,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071866246] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:13,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119964131] [2022-04-28 09:15:13,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:15:13,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:13,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:13,843 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 09:15:13,844 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 09:15:13,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:15:13,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:13,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 09:15:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:13,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:14,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {4090#true} call ULTIMATE.init(); {4090#true} is VALID [2022-04-28 09:15:14,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {4090#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(14, 2);call #Ultimate.allocInit(12, 3); {4090#true} is VALID [2022-04-28 09:15:14,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {4090#true} assume true; {4090#true} is VALID [2022-04-28 09:15:14,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4090#true} {4090#true} #42#return; {4090#true} is VALID [2022-04-28 09:15:14,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {4090#true} call #t~ret6 := main(); {4090#true} is VALID [2022-04-28 09:15:14,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {4090#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4095#(= main_~x~0 0)} is VALID [2022-04-28 09:15:14,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {4095#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {4095#(= main_~x~0 0)} is VALID [2022-04-28 09:15:14,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {4095#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4096#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:14,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {4096#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4096#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:14,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {4096#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4097#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:14,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {4097#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4097#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:14,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {4097#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4098#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:14,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {4098#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {4098#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:14,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {4098#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4099#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:14,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {4099#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4099#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:14,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {4099#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4100#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:14,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {4100#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4100#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:14,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {4100#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4101#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:14,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {4101#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4101#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:14,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {4101#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4164#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:14,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {4164#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 < 99); {4091#false} is VALID [2022-04-28 09:15:14,132 INFO L272 TraceCheckUtils]: 21: Hoare triple {4091#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4091#false} is VALID [2022-04-28 09:15:14,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {4091#false} ~cond := #in~cond; {4091#false} is VALID [2022-04-28 09:15:14,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {4091#false} assume 0 == ~cond; {4091#false} is VALID [2022-04-28 09:15:14,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {4091#false} assume !false; {4091#false} is VALID [2022-04-28 09:15:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:14,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:14,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {4091#false} assume !false; {4091#false} is VALID [2022-04-28 09:15:14,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {4091#false} assume 0 == ~cond; {4091#false} is VALID [2022-04-28 09:15:14,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {4091#false} ~cond := #in~cond; {4091#false} is VALID [2022-04-28 09:15:14,323 INFO L272 TraceCheckUtils]: 21: Hoare triple {4091#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4091#false} is VALID [2022-04-28 09:15:14,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {4192#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {4091#false} is VALID [2022-04-28 09:15:14,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {4196#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4192#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:15:14,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {4196#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4196#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:14,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {4203#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4196#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:14,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {4203#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4203#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:14,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {4210#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4203#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:14,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {4210#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4210#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:15:14,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {4217#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4210#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:15:14,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {4217#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4217#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:15:14,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {4224#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4217#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:15:14,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {4224#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4224#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:15:14,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {4231#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4224#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:15:14,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {4231#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4231#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:15:14,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {4238#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4231#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:15:14,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {4238#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4238#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:15:14,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {4090#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4238#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:15:14,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {4090#true} call #t~ret6 := main(); {4090#true} is VALID [2022-04-28 09:15:14,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4090#true} {4090#true} #42#return; {4090#true} is VALID [2022-04-28 09:15:14,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {4090#true} assume true; {4090#true} is VALID [2022-04-28 09:15:14,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {4090#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(14, 2);call #Ultimate.allocInit(12, 3); {4090#true} is VALID [2022-04-28 09:15:14,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {4090#true} call ULTIMATE.init(); {4090#true} is VALID [2022-04-28 09:15:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:14,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119964131] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:14,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:14,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 09:15:14,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:14,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038245699] [2022-04-28 09:15:14,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038245699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:14,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:14,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:15:14,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634165604] [2022-04-28 09:15:14,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:14,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 09:15:14,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:14,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 09:15:14,349 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 09:15:14,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:15:14,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:14,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:15:14,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:15:14,350 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 09:15:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:14,702 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 09:15:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:15:14,702 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 09:15:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 09:15:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-28 09:15:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 09:15:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-28 09:15:14,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 34 transitions. [2022-04-28 09:15:14,729 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 09:15:14,729 INFO L225 Difference]: With dead ends: 34 [2022-04-28 09:15:14,729 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 09:15:14,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 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 09:15:14,730 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:14,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:15:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 09:15:14,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-28 09:15:14,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:14,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 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 09:15:14,765 INFO L74 IsIncluded]: Start isIncluded. First operand 29 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 09:15:14,765 INFO L87 Difference]: Start difference. First operand 29 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 09:15:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:14,765 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 09:15:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 09:15:14,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:14,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:14,766 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 29 states. [2022-04-28 09:15:14,766 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 29 states. [2022-04-28 09:15:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:14,766 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 09:15:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 09:15:14,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:14,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:14,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:14,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:14,766 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 09:15:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-28 09:15:14,767 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2022-04-28 09:15:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:14,767 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-28 09:15:14,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 09:15:14,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-28 09:15:14,794 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 09:15:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 09:15:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 09:15:14,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:14,794 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:14,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 09:15:14,994 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,SelfDestructingSolverStorable16 [2022-04-28 09:15:14,995 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:14,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:14,995 INFO L85 PathProgramCache]: Analyzing trace with hash 836038096, now seen corresponding path program 15 times [2022-04-28 09:15:14,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:14,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [437456588] [2022-04-28 09:15:14,998 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:14,998 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:14,998 INFO L85 PathProgramCache]: Analyzing trace with hash 836038096, now seen corresponding path program 16 times [2022-04-28 09:15:14,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:14,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355135336] [2022-04-28 09:15:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:14,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:15,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:15,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {4474#(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(14, 2);call #Ultimate.allocInit(12, 3); {4460#true} is VALID [2022-04-28 09:15:15,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-28 09:15:15,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4460#true} {4460#true} #42#return; {4460#true} is VALID [2022-04-28 09:15:15,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {4460#true} call ULTIMATE.init(); {4474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:15,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {4474#(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(14, 2);call #Ultimate.allocInit(12, 3); {4460#true} is VALID [2022-04-28 09:15:15,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-28 09:15:15,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4460#true} {4460#true} #42#return; {4460#true} is VALID [2022-04-28 09:15:15,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {4460#true} call #t~ret6 := main(); {4460#true} is VALID [2022-04-28 09:15:15,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {4460#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4465#(= main_~x~0 0)} is VALID [2022-04-28 09:15:15,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {4465#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {4465#(= main_~x~0 0)} is VALID [2022-04-28 09:15:15,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {4465#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4466#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:15,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {4466#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4466#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:15,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {4466#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4467#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:15,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {4467#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4467#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:15,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {4467#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4468#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:15,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {4468#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {4468#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:15,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {4468#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:15,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {4469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:15,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {4469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4470#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:15,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {4470#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4470#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:15,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {4470#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:15,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {4471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:15,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {4471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4472#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:15,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {4472#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {4472#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:15,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {4472#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4473#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:15,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {4473#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {4461#false} is VALID [2022-04-28 09:15:15,129 INFO L272 TraceCheckUtils]: 23: Hoare triple {4461#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4461#false} is VALID [2022-04-28 09:15:15,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {4461#false} ~cond := #in~cond; {4461#false} is VALID [2022-04-28 09:15:15,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {4461#false} assume 0 == ~cond; {4461#false} is VALID [2022-04-28 09:15:15,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-04-28 09:15:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:15,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355135336] [2022-04-28 09:15:15,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355135336] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:15,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217337947] [2022-04-28 09:15:15,130 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:15:15,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:15,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:15,131 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 09:15:15,133 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 09:15:15,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:15:15,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:15,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 09:15:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:15,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:15,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {4460#true} call ULTIMATE.init(); {4460#true} is VALID [2022-04-28 09:15:15,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#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(14, 2);call #Ultimate.allocInit(12, 3); {4460#true} is VALID [2022-04-28 09:15:15,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-28 09:15:15,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4460#true} {4460#true} #42#return; {4460#true} is VALID [2022-04-28 09:15:15,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {4460#true} call #t~ret6 := main(); {4460#true} is VALID [2022-04-28 09:15:15,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {4460#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4465#(= main_~x~0 0)} is VALID [2022-04-28 09:15:15,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {4465#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {4465#(= main_~x~0 0)} is VALID [2022-04-28 09:15:15,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {4465#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4499#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:15,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {4499#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {4499#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:15,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {4499#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4506#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:15:15,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {4506#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume !!(~x~0 % 4294967296 < 99); {4506#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:15:15,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {4506#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4513#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:15,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {4513#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {4513#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:15,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {4513#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4520#(and (= (+ main_~x~0 (- 8)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:15,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {4520#(and (= (+ main_~x~0 (- 8)) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {4520#(and (= (+ main_~x~0 (- 8)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:15,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {4520#(and (= (+ main_~x~0 (- 8)) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4527#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:15,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {4527#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {4527#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:15,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {4527#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4534#(and (<= (mod main_~y~0 2) 0) (= 10 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:15,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {4534#(and (<= (mod main_~y~0 2) 0) (= 10 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {4534#(and (<= (mod main_~y~0 2) 0) (= 10 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:15,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {4534#(and (<= (mod main_~y~0 2) 0) (= 10 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4541#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 10))} is VALID [2022-04-28 09:15:15,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {4541#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 10))} assume !!(~x~0 % 4294967296 < 99); {4541#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 10))} is VALID [2022-04-28 09:15:15,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {4541#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 10))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4548#(and (= (+ main_~x~0 (- 6)) 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:15,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {4548#(and (= (+ main_~x~0 (- 6)) 10) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {4548#(and (= (+ main_~x~0 (- 6)) 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:15,535 INFO L272 TraceCheckUtils]: 23: Hoare triple {4548#(and (= (+ main_~x~0 (- 6)) 10) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:15,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {4555#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:15,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {4559#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4461#false} is VALID [2022-04-28 09:15:15,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-04-28 09:15:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:15,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:15,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-04-28 09:15:15,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {4559#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4461#false} is VALID [2022-04-28 09:15:15,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {4555#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:15,844 INFO L272 TraceCheckUtils]: 23: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:15,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {4624#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4575#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:15,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {4624#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {4624#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:15,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {4460#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4624#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:15,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {4460#true} call #t~ret6 := main(); {4460#true} is VALID [2022-04-28 09:15:15,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4460#true} {4460#true} #42#return; {4460#true} is VALID [2022-04-28 09:15:15,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-28 09:15:15,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#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(14, 2);call #Ultimate.allocInit(12, 3); {4460#true} is VALID [2022-04-28 09:15:15,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {4460#true} call ULTIMATE.init(); {4460#true} is VALID [2022-04-28 09:15:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-28 09:15:15,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217337947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:15,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:15,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 6] total 24 [2022-04-28 09:15:15,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:15,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [437456588] [2022-04-28 09:15:15,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [437456588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:15,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:15,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:15:15,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227404950] [2022-04-28 09:15:15,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:15,854 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 09:15:15,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:15,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 09:15:15,873 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 09:15:15,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:15:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:15,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:15:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:15:15,874 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 09:15:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:16,297 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 09:15:16,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:15:16,297 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 09:15:16,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 09:15:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-28 09:15:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 09:15:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-28 09:15:16,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 36 transitions. [2022-04-28 09:15:16,327 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 09:15:16,328 INFO L225 Difference]: With dead ends: 36 [2022-04-28 09:15:16,328 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 09:15:16,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 09:15:16,329 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:16,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:15:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 09:15:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-28 09:15:16,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:16,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 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 09:15:16,372 INFO L74 IsIncluded]: Start isIncluded. First operand 31 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 09:15:16,372 INFO L87 Difference]: Start difference. First operand 31 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 09:15:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:16,373 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 09:15:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 09:15:16,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:16,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:16,373 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 31 states. [2022-04-28 09:15:16,373 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 31 states. [2022-04-28 09:15:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:16,373 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 09:15:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 09:15:16,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:16,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:16,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:16,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:16,374 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 09:15:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-28 09:15:16,374 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2022-04-28 09:15:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:16,375 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-28 09:15:16,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 09:15:16,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-28 09:15:16,425 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 09:15:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 09:15:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 09:15:16,426 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:16,426 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:16,442 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 09:15:16,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:16,627 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:16,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1315692109, now seen corresponding path program 17 times [2022-04-28 09:15:16,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:16,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [807499359] [2022-04-28 09:15:16,630 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:16,630 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:16,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1315692109, now seen corresponding path program 18 times [2022-04-28 09:15:16,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:16,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588014416] [2022-04-28 09:15:16,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:16,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:16,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {4875#(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(14, 2);call #Ultimate.allocInit(12, 3); {4860#true} is VALID [2022-04-28 09:15:16,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {4860#true} assume true; {4860#true} is VALID [2022-04-28 09:15:16,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4860#true} {4860#true} #42#return; {4860#true} is VALID [2022-04-28 09:15:16,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {4860#true} call ULTIMATE.init(); {4875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:16,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {4875#(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(14, 2);call #Ultimate.allocInit(12, 3); {4860#true} is VALID [2022-04-28 09:15:16,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {4860#true} assume true; {4860#true} is VALID [2022-04-28 09:15:16,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4860#true} {4860#true} #42#return; {4860#true} is VALID [2022-04-28 09:15:16,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {4860#true} call #t~ret6 := main(); {4860#true} is VALID [2022-04-28 09:15:16,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {4860#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4865#(= main_~x~0 0)} is VALID [2022-04-28 09:15:16,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {4865#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {4865#(= main_~x~0 0)} is VALID [2022-04-28 09:15:16,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {4865#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:16,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {4866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:16,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {4866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4867#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:16,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {4867#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4867#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:16,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {4867#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4868#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:16,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {4868#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {4868#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:16,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {4868#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4869#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:16,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {4869#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4869#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:16,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {4869#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:16,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {4870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:16,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {4870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:16,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {4871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:16,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {4871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4872#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:16,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {4872#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {4872#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:16,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {4872#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:16,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {4873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:16,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {4873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4874#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:16,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {4874#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {4861#false} is VALID [2022-04-28 09:15:16,795 INFO L272 TraceCheckUtils]: 25: Hoare triple {4861#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4861#false} is VALID [2022-04-28 09:15:16,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {4861#false} ~cond := #in~cond; {4861#false} is VALID [2022-04-28 09:15:16,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {4861#false} assume 0 == ~cond; {4861#false} is VALID [2022-04-28 09:15:16,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {4861#false} assume !false; {4861#false} is VALID [2022-04-28 09:15:16,795 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:16,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:16,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588014416] [2022-04-28 09:15:16,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588014416] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:16,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111883657] [2022-04-28 09:15:16,796 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:15:16,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:16,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:16,797 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 09:15:16,798 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 09:15:16,848 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 09:15:16,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:16,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 09:15:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:16,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:17,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {4860#true} call ULTIMATE.init(); {4860#true} is VALID [2022-04-28 09:15:17,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {4860#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(14, 2);call #Ultimate.allocInit(12, 3); {4860#true} is VALID [2022-04-28 09:15:17,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {4860#true} assume true; {4860#true} is VALID [2022-04-28 09:15:17,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4860#true} {4860#true} #42#return; {4860#true} is VALID [2022-04-28 09:15:17,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {4860#true} call #t~ret6 := main(); {4860#true} is VALID [2022-04-28 09:15:17,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {4860#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4865#(= main_~x~0 0)} is VALID [2022-04-28 09:15:17,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {4865#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {4865#(= main_~x~0 0)} is VALID [2022-04-28 09:15:17,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {4865#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:17,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {4866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:17,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {4866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4867#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:17,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {4867#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4867#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:17,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {4867#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4868#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:17,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {4868#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {4868#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:17,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {4868#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4869#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:17,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {4869#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4869#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:17,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {4869#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:17,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {4870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:17,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {4870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:17,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {4871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:17,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {4871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4872#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:17,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {4872#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {4872#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:17,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {4872#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:17,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {4873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:17,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {4873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4948#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:17,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {4948#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {4861#false} is VALID [2022-04-28 09:15:17,178 INFO L272 TraceCheckUtils]: 25: Hoare triple {4861#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4861#false} is VALID [2022-04-28 09:15:17,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {4861#false} ~cond := #in~cond; {4861#false} is VALID [2022-04-28 09:15:17,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {4861#false} assume 0 == ~cond; {4861#false} is VALID [2022-04-28 09:15:17,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {4861#false} assume !false; {4861#false} is VALID [2022-04-28 09:15:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:17,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:17,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {4861#false} assume !false; {4861#false} is VALID [2022-04-28 09:15:17,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {4861#false} assume 0 == ~cond; {4861#false} is VALID [2022-04-28 09:15:17,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {4861#false} ~cond := #in~cond; {4861#false} is VALID [2022-04-28 09:15:17,508 INFO L272 TraceCheckUtils]: 25: Hoare triple {4861#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4861#false} is VALID [2022-04-28 09:15:17,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {4976#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {4861#false} is VALID [2022-04-28 09:15:17,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {4980#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4976#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:15:17,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {4980#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4980#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:17,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {4987#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4980#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:17,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {4987#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4987#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:17,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {4994#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4987#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:17,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {4994#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4994#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:15:17,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {5001#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4994#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:15:17,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {5001#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5001#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:15:17,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {5008#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5001#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:15:17,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {5008#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5008#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:15:17,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {5015#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5008#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:15:17,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {5015#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5015#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:15:17,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {5022#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5015#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:15:17,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {5022#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5022#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:15:17,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {5029#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5022#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:15:17,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {5029#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5029#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:15:17,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {5036#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5029#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:15:17,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {5036#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5036#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:15:17,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {4860#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5036#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:15:17,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {4860#true} call #t~ret6 := main(); {4860#true} is VALID [2022-04-28 09:15:17,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4860#true} {4860#true} #42#return; {4860#true} is VALID [2022-04-28 09:15:17,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {4860#true} assume true; {4860#true} is VALID [2022-04-28 09:15:17,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {4860#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(14, 2);call #Ultimate.allocInit(12, 3); {4860#true} is VALID [2022-04-28 09:15:17,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {4860#true} call ULTIMATE.init(); {4860#true} is VALID [2022-04-28 09:15:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:17,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111883657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:17,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:17,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 09:15:17,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:17,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [807499359] [2022-04-28 09:15:17,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [807499359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:17,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:17,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 09:15:17,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366605514] [2022-04-28 09:15:17,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:17,520 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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 09:15:17,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:17,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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 09:15:17,555 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 09:15:17,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 09:15:17,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:17,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 09:15:17,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:15:17,556 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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 09:15:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:18,074 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 09:15:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:15:18,074 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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 09:15:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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 09:15:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2022-04-28 09:15:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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 09:15:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2022-04-28 09:15:18,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 38 transitions. [2022-04-28 09:15:18,098 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 09:15:18,098 INFO L225 Difference]: With dead ends: 38 [2022-04-28 09:15:18,098 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 09:15:18,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=799, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:15:18,099 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:18,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 33 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:15:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 09:15:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-28 09:15:18,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:18,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 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 09:15:18,136 INFO L74 IsIncluded]: Start isIncluded. First operand 33 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 09:15:18,137 INFO L87 Difference]: Start difference. First operand 33 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 09:15:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:18,137 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 09:15:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 09:15:18,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:18,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:18,138 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 33 states. [2022-04-28 09:15:18,138 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 33 states. [2022-04-28 09:15:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:18,141 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 09:15:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 09:15:18,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:18,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:18,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:18,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:18,142 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 09:15:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-28 09:15:18,143 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2022-04-28 09:15:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:18,143 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-28 09:15:18,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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 09:15:18,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-28 09:15:18,183 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 09:15:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 09:15:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 09:15:18,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:18,184 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:18,202 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 09:15:18,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:18,400 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:18,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:18,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1593269366, now seen corresponding path program 19 times [2022-04-28 09:15:18,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:18,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1740742645] [2022-04-28 09:15:18,405 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:18,405 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1593269366, now seen corresponding path program 20 times [2022-04-28 09:15:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:18,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481538578] [2022-04-28 09:15:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:18,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {5302#(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(14, 2);call #Ultimate.allocInit(12, 3); {5286#true} is VALID [2022-04-28 09:15:18,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {5286#true} assume true; {5286#true} is VALID [2022-04-28 09:15:18,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5286#true} {5286#true} #42#return; {5286#true} is VALID [2022-04-28 09:15:18,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {5286#true} call ULTIMATE.init(); {5302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:18,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {5302#(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(14, 2);call #Ultimate.allocInit(12, 3); {5286#true} is VALID [2022-04-28 09:15:18,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {5286#true} assume true; {5286#true} is VALID [2022-04-28 09:15:18,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5286#true} {5286#true} #42#return; {5286#true} is VALID [2022-04-28 09:15:18,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {5286#true} call #t~ret6 := main(); {5286#true} is VALID [2022-04-28 09:15:18,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {5286#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5291#(= main_~x~0 0)} is VALID [2022-04-28 09:15:18,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {5291#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {5291#(= main_~x~0 0)} is VALID [2022-04-28 09:15:18,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {5291#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5292#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:18,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {5292#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5292#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:18,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {5292#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5293#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:18,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {5293#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5293#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:18,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {5293#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5294#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:18,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {5294#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {5294#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:18,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {5294#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5295#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:18,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {5295#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5295#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:18,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {5295#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:18,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {5296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:18,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {5296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5297#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:18,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {5297#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5297#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:18,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {5297#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5298#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:18,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {5298#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {5298#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:18,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {5298#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5299#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:18,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {5299#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5299#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:18,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {5299#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5300#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:18,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {5300#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5300#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:18,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {5300#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5301#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:18,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {5301#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {5287#false} is VALID [2022-04-28 09:15:18,564 INFO L272 TraceCheckUtils]: 27: Hoare triple {5287#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5287#false} is VALID [2022-04-28 09:15:18,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {5287#false} ~cond := #in~cond; {5287#false} is VALID [2022-04-28 09:15:18,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {5287#false} assume 0 == ~cond; {5287#false} is VALID [2022-04-28 09:15:18,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {5287#false} assume !false; {5287#false} is VALID [2022-04-28 09:15:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:18,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:18,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481538578] [2022-04-28 09:15:18,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481538578] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:18,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019897760] [2022-04-28 09:15:18,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:15:18,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:18,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:18,566 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 09:15:18,567 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 09:15:18,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:15:18,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:18,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 09:15:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:18,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:18,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {5286#true} call ULTIMATE.init(); {5286#true} is VALID [2022-04-28 09:15:18,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {5286#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(14, 2);call #Ultimate.allocInit(12, 3); {5286#true} is VALID [2022-04-28 09:15:18,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {5286#true} assume true; {5286#true} is VALID [2022-04-28 09:15:18,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5286#true} {5286#true} #42#return; {5286#true} is VALID [2022-04-28 09:15:18,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {5286#true} call #t~ret6 := main(); {5286#true} is VALID [2022-04-28 09:15:18,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {5286#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5291#(= main_~x~0 0)} is VALID [2022-04-28 09:15:18,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {5291#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {5291#(= main_~x~0 0)} is VALID [2022-04-28 09:15:18,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {5291#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5292#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:18,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {5292#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5292#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:18,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {5292#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5293#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:18,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {5293#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5293#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:18,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {5293#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5294#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:18,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {5294#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {5294#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:18,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {5294#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5295#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:18,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {5295#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5295#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:18,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {5295#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:18,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {5296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:18,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {5296#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5297#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:18,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {5297#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5297#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:18,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {5297#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5298#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:18,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {5298#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {5298#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:18,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {5298#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5299#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:18,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {5299#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5299#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:18,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {5299#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5300#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:18,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {5300#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5300#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:18,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {5300#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5381#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:18,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {5381#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {5287#false} is VALID [2022-04-28 09:15:18,928 INFO L272 TraceCheckUtils]: 27: Hoare triple {5287#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5287#false} is VALID [2022-04-28 09:15:18,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {5287#false} ~cond := #in~cond; {5287#false} is VALID [2022-04-28 09:15:18,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {5287#false} assume 0 == ~cond; {5287#false} is VALID [2022-04-28 09:15:18,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {5287#false} assume !false; {5287#false} is VALID [2022-04-28 09:15:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:18,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:19,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {5287#false} assume !false; {5287#false} is VALID [2022-04-28 09:15:19,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {5287#false} assume 0 == ~cond; {5287#false} is VALID [2022-04-28 09:15:19,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {5287#false} ~cond := #in~cond; {5287#false} is VALID [2022-04-28 09:15:19,171 INFO L272 TraceCheckUtils]: 27: Hoare triple {5287#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5287#false} is VALID [2022-04-28 09:15:19,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {5409#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {5287#false} is VALID [2022-04-28 09:15:19,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {5413#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5409#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:15:19,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {5413#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5413#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:19,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {5420#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5413#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:19,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {5420#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5420#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:19,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {5427#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5420#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:19,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {5427#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5427#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:15:19,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {5434#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5427#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:15:19,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {5434#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5434#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:15:19,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {5441#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5434#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:15:19,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {5441#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5441#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:15:19,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {5448#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5441#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:15:19,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {5448#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5448#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:15:19,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {5455#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5448#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:15:19,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {5455#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5455#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:15:19,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {5462#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5455#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:15:19,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {5462#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5462#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:15:19,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {5469#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5462#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:15:19,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {5469#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5469#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:15:19,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {5476#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5469#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:15:19,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {5476#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5476#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:15:19,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {5286#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5476#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:15:19,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {5286#true} call #t~ret6 := main(); {5286#true} is VALID [2022-04-28 09:15:19,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5286#true} {5286#true} #42#return; {5286#true} is VALID [2022-04-28 09:15:19,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {5286#true} assume true; {5286#true} is VALID [2022-04-28 09:15:19,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {5286#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(14, 2);call #Ultimate.allocInit(12, 3); {5286#true} is VALID [2022-04-28 09:15:19,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {5286#true} call ULTIMATE.init(); {5286#true} is VALID [2022-04-28 09:15:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:19,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019897760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:19,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:19,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 09:15:19,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:19,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1740742645] [2022-04-28 09:15:19,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1740742645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:19,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:19,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 09:15:19,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356008728] [2022-04-28 09:15:19,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:19,180 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 09:15:19,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:19,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 09:15:19,196 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 09:15:19,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 09:15:19,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:19,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 09:15:19,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-28 09:15:19,197 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 09:15:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:19,664 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 09:15:19,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 09:15:19,665 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 09:15:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 09:15:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2022-04-28 09:15:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 09:15:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2022-04-28 09:15:19,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 40 transitions. [2022-04-28 09:15:19,687 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 09:15:19,687 INFO L225 Difference]: With dead ends: 40 [2022-04-28 09:15:19,687 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 09:15:19,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 09:15:19,688 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:19,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:15:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 09:15:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-28 09:15:19,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:19,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 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 09:15:19,726 INFO L74 IsIncluded]: Start isIncluded. First operand 35 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 09:15:19,726 INFO L87 Difference]: Start difference. First operand 35 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 09:15:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:19,726 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 09:15:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 09:15:19,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:19,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:19,727 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 35 states. [2022-04-28 09:15:19,727 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 35 states. [2022-04-28 09:15:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:19,727 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 09:15:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 09:15:19,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:19,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:19,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:19,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:19,728 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 09:15:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-28 09:15:19,728 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2022-04-28 09:15:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:19,728 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-28 09:15:19,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 09:15:19,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-28 09:15:19,757 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 09:15:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 09:15:19,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 09:15:19,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:19,758 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:19,774 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 09:15:19,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:19,975 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1081537145, now seen corresponding path program 21 times [2022-04-28 09:15:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:19,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [894028579] [2022-04-28 09:15:19,977 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:19,977 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1081537145, now seen corresponding path program 22 times [2022-04-28 09:15:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:19,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539448829] [2022-04-28 09:15:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:20,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:20,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {5757#(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(14, 2);call #Ultimate.allocInit(12, 3); {5740#true} is VALID [2022-04-28 09:15:20,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {5740#true} assume true; {5740#true} is VALID [2022-04-28 09:15:20,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5740#true} {5740#true} #42#return; {5740#true} is VALID [2022-04-28 09:15:20,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {5740#true} call ULTIMATE.init(); {5757#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:20,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {5757#(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(14, 2);call #Ultimate.allocInit(12, 3); {5740#true} is VALID [2022-04-28 09:15:20,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {5740#true} assume true; {5740#true} is VALID [2022-04-28 09:15:20,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5740#true} {5740#true} #42#return; {5740#true} is VALID [2022-04-28 09:15:20,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {5740#true} call #t~ret6 := main(); {5740#true} is VALID [2022-04-28 09:15:20,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {5740#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5745#(= main_~x~0 0)} is VALID [2022-04-28 09:15:20,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {5745#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {5745#(= main_~x~0 0)} is VALID [2022-04-28 09:15:20,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {5745#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5746#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:20,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {5746#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5746#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:20,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {5746#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5747#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:20,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {5747#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5747#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:20,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {5747#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5748#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:20,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {5748#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {5748#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:20,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {5748#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5749#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:20,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {5749#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5749#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:20,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {5749#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5750#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:20,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {5750#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5750#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:20,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {5750#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:20,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {5751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:20,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {5751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5752#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:20,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {5752#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {5752#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:20,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {5752#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5753#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:20,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {5753#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5753#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:20,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {5753#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5754#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:20,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {5754#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5754#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:20,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {5754#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5755#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:20,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {5755#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5755#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:20,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {5755#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5756#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:20,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {5756#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 99); {5741#false} is VALID [2022-04-28 09:15:20,170 INFO L272 TraceCheckUtils]: 29: Hoare triple {5741#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5741#false} is VALID [2022-04-28 09:15:20,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {5741#false} ~cond := #in~cond; {5741#false} is VALID [2022-04-28 09:15:20,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {5741#false} assume 0 == ~cond; {5741#false} is VALID [2022-04-28 09:15:20,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {5741#false} assume !false; {5741#false} is VALID [2022-04-28 09:15:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:20,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:20,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539448829] [2022-04-28 09:15:20,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539448829] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:20,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130856335] [2022-04-28 09:15:20,171 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:15:20,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:20,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:20,172 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 09:15:20,188 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 09:15:20,218 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:15:20,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:20,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 09:15:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:20,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:20,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {5740#true} call ULTIMATE.init(); {5740#true} is VALID [2022-04-28 09:15:20,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {5740#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(14, 2);call #Ultimate.allocInit(12, 3); {5740#true} is VALID [2022-04-28 09:15:20,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {5740#true} assume true; {5740#true} is VALID [2022-04-28 09:15:20,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5740#true} {5740#true} #42#return; {5740#true} is VALID [2022-04-28 09:15:20,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {5740#true} call #t~ret6 := main(); {5740#true} is VALID [2022-04-28 09:15:20,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {5740#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5745#(= main_~x~0 0)} is VALID [2022-04-28 09:15:20,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {5745#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {5745#(= main_~x~0 0)} is VALID [2022-04-28 09:15:20,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {5745#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5782#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {5782#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {5782#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {5782#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5789#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-28 09:15:20,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {5789#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5789#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-28 09:15:20,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {5789#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5796#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:15:20,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {5796#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {5796#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:15:20,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {5796#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5803#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {5803#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {5803#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {5803#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5810#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:15:20,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {5810#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < 99); {5810#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:15:20,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {5810#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5817#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {5817#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {5817#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {5817#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5824#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {5824#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {5824#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {5824#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5831#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-28 09:15:20,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {5831#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume !!(~x~0 % 4294967296 < 99); {5831#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-28 09:15:20,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {5831#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5838#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {5838#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {5838#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {5838#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5845#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {5845#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {5845#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {5845#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5852#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {5852#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {5852#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:20,576 INFO L272 TraceCheckUtils]: 29: Hoare triple {5852#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5859#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:20,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {5859#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5863#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:20,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {5863#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5741#false} is VALID [2022-04-28 09:15:20,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {5741#false} assume !false; {5741#false} is VALID [2022-04-28 09:15:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:20,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:20,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {5741#false} assume !false; {5741#false} is VALID [2022-04-28 09:15:20,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {5863#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5741#false} is VALID [2022-04-28 09:15:20,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {5859#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5863#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:20,856 INFO L272 TraceCheckUtils]: 29: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5859#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:20,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {5946#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:20,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {5946#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {5946#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:20,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {5740#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5946#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:20,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {5740#true} call #t~ret6 := main(); {5740#true} is VALID [2022-04-28 09:15:20,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5740#true} {5740#true} #42#return; {5740#true} is VALID [2022-04-28 09:15:20,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {5740#true} assume true; {5740#true} is VALID [2022-04-28 09:15:20,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {5740#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(14, 2);call #Ultimate.allocInit(12, 3); {5740#true} is VALID [2022-04-28 09:15:20,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {5740#true} call ULTIMATE.init(); {5740#true} is VALID [2022-04-28 09:15:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-28 09:15:20,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130856335] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:20,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:20,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 6] total 30 [2022-04-28 09:15:20,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:20,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [894028579] [2022-04-28 09:15:20,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [894028579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:20,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:20,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 09:15:20,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436707082] [2022-04-28 09:15:20,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:20,888 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 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 09:15:20,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:20,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 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 09:15:20,910 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 09:15:20,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 09:15:20,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:20,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 09:15:20,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2022-04-28 09:15:20,911 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 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 09:15:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:21,544 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 09:15:21,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 09:15:21,544 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 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 09:15:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:21,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 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 09:15:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-28 09:15:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 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 09:15:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-28 09:15:21,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 42 transitions. [2022-04-28 09:15:21,578 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 09:15:21,578 INFO L225 Difference]: With dead ends: 42 [2022-04-28 09:15:21,578 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 09:15:21,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=1519, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 09:15:21,579 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:21,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:15:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 09:15:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-28 09:15:21,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:21,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 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 09:15:21,644 INFO L74 IsIncluded]: Start isIncluded. First operand 37 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 09:15:21,645 INFO L87 Difference]: Start difference. First operand 37 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 09:15:21,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:21,645 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 09:15:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 09:15:21,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:21,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:21,645 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 37 states. [2022-04-28 09:15:21,646 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 37 states. [2022-04-28 09:15:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:21,646 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 09:15:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 09:15:21,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:21,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:21,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:21,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:21,646 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 09:15:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-28 09:15:21,647 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2022-04-28 09:15:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:21,647 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-28 09:15:21,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 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 09:15:21,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-28 09:15:21,685 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 09:15:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 09:15:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 09:15:21,686 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:21,686 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:21,702 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 09:15:21,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:21,887 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:21,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:21,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1066855492, now seen corresponding path program 23 times [2022-04-28 09:15:21,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:21,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [554440983] [2022-04-28 09:15:21,889 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:21,889 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1066855492, now seen corresponding path program 24 times [2022-04-28 09:15:21,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:21,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427240652] [2022-04-28 09:15:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:22,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {6242#(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(14, 2);call #Ultimate.allocInit(12, 3); {6224#true} is VALID [2022-04-28 09:15:22,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-28 09:15:22,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6224#true} {6224#true} #42#return; {6224#true} is VALID [2022-04-28 09:15:22,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {6224#true} call ULTIMATE.init(); {6242#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:22,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {6242#(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(14, 2);call #Ultimate.allocInit(12, 3); {6224#true} is VALID [2022-04-28 09:15:22,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-28 09:15:22,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6224#true} {6224#true} #42#return; {6224#true} is VALID [2022-04-28 09:15:22,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {6224#true} call #t~ret6 := main(); {6224#true} is VALID [2022-04-28 09:15:22,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {6224#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6229#(= main_~x~0 0)} is VALID [2022-04-28 09:15:22,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {6229#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {6229#(= main_~x~0 0)} is VALID [2022-04-28 09:15:22,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {6229#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6230#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:22,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {6230#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6230#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:22,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {6230#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6231#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:22,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {6231#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6231#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:22,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {6231#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6232#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:22,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {6232#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {6232#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:22,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {6232#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6233#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:22,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {6233#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6233#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:22,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {6233#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6234#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:22,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {6234#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6234#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:22,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {6234#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6235#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:22,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {6235#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6235#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:22,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {6235#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6236#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:22,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {6236#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {6236#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:22,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {6236#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6237#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:22,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {6237#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6237#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:22,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {6237#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6238#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:22,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {6238#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6238#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:22,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {6238#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6239#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:22,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {6239#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6239#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:22,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {6239#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6240#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:22,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {6240#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {6240#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:22,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {6240#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6241#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:22,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {6241#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {6225#false} is VALID [2022-04-28 09:15:22,099 INFO L272 TraceCheckUtils]: 31: Hoare triple {6225#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6225#false} is VALID [2022-04-28 09:15:22,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {6225#false} ~cond := #in~cond; {6225#false} is VALID [2022-04-28 09:15:22,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {6225#false} assume 0 == ~cond; {6225#false} is VALID [2022-04-28 09:15:22,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {6225#false} assume !false; {6225#false} is VALID [2022-04-28 09:15:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:22,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:22,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427240652] [2022-04-28 09:15:22,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427240652] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:22,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811496696] [2022-04-28 09:15:22,099 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:15:22,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:22,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:22,101 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 09:15:22,102 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 09:15:22,184 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 09:15:22,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:22,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 09:15:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:22,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:22,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {6224#true} call ULTIMATE.init(); {6224#true} is VALID [2022-04-28 09:15:22,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {6224#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(14, 2);call #Ultimate.allocInit(12, 3); {6224#true} is VALID [2022-04-28 09:15:22,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-28 09:15:22,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6224#true} {6224#true} #42#return; {6224#true} is VALID [2022-04-28 09:15:22,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {6224#true} call #t~ret6 := main(); {6224#true} is VALID [2022-04-28 09:15:22,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {6224#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6229#(= main_~x~0 0)} is VALID [2022-04-28 09:15:22,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {6229#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {6229#(= main_~x~0 0)} is VALID [2022-04-28 09:15:22,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {6229#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6230#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:22,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {6230#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6230#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:22,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {6230#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6231#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:22,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {6231#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6231#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:22,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {6231#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6232#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:22,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {6232#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {6232#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:22,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {6232#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6233#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:22,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {6233#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6233#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:22,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {6233#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6234#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:22,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {6234#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6234#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:22,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {6234#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6297#(and (<= main_~x~0 12) (<= 12 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:22,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {6297#(and (<= main_~x~0 12) (<= 12 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {6297#(and (<= main_~x~0 12) (<= 12 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:22,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {6297#(and (<= main_~x~0 12) (<= 12 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6304#(and (<= 14 main_~x~0) (<= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:22,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {6304#(and (<= 14 main_~x~0) (<= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {6304#(and (<= 14 main_~x~0) (<= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:22,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {6304#(and (<= 14 main_~x~0) (<= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6311#(and (<= main_~x~0 16) (<= (mod main_~y~0 2) 0) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:22,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {6311#(and (<= main_~x~0 16) (<= (mod main_~y~0 2) 0) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6311#(and (<= main_~x~0 16) (<= (mod main_~y~0 2) 0) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:22,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {6311#(and (<= main_~x~0 16) (<= (mod main_~y~0 2) 0) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6318#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:22,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {6318#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6318#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:22,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {6318#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6325#(and (<= main_~x~0 20) (<= 20 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:22,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {6325#(and (<= main_~x~0 20) (<= 20 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {6325#(and (<= main_~x~0 20) (<= 20 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:22,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {6325#(and (<= main_~x~0 20) (<= 20 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6332#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:22,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {6332#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {6332#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:22,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {6332#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6339#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:22,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {6339#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {6339#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:22,929 INFO L272 TraceCheckUtils]: 31: Hoare triple {6339#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:22,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {6346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:22,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {6350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6225#false} is VALID [2022-04-28 09:15:22,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {6225#false} assume !false; {6225#false} is VALID [2022-04-28 09:15:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:22,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:23,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {6225#false} assume !false; {6225#false} is VALID [2022-04-28 09:15:23,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {6350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6225#false} is VALID [2022-04-28 09:15:23,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {6346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:23,297 INFO L272 TraceCheckUtils]: 31: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:23,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {6409#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6366#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:23,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {6409#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {6409#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:23,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {6409#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6409#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:23,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {6409#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {6409#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:23,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {6409#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6409#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:23,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {6409#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {6409#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:23,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {6409#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6409#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:23,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {6409#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {6409#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:23,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {6409#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6409#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:23,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {6409#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {6409#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:23,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {6409#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6409#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:23,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {6409#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {6409#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:23,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {6224#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6409#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:23,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {6224#true} call #t~ret6 := main(); {6224#true} is VALID [2022-04-28 09:15:23,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6224#true} {6224#true} #42#return; {6224#true} is VALID [2022-04-28 09:15:23,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-28 09:15:23,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {6224#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(14, 2);call #Ultimate.allocInit(12, 3); {6224#true} is VALID [2022-04-28 09:15:23,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {6224#true} call ULTIMATE.init(); {6224#true} is VALID [2022-04-28 09:15:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 09:15:23,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811496696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:23,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:23,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 6] total 27 [2022-04-28 09:15:23,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:23,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [554440983] [2022-04-28 09:15:23,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [554440983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:23,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:23,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 09:15:23,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692919879] [2022-04-28 09:15:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:23,309 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 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 09:15:23,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:23,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 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 09:15:23,326 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 09:15:23,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 09:15:23,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:23,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 09:15:23,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:15:23,327 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 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 09:15:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:23,915 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 09:15:23,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 09:15:23,915 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 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 09:15:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 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 09:15:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 44 transitions. [2022-04-28 09:15:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 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 09:15:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 44 transitions. [2022-04-28 09:15:23,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 44 transitions. [2022-04-28 09:15:23,939 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 09:15:23,939 INFO L225 Difference]: With dead ends: 44 [2022-04-28 09:15:23,940 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 09:15:23,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 09:15:23,943 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:23,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 58 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:15:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 09:15:23,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-28 09:15:23,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:23,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 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 09:15:23,994 INFO L74 IsIncluded]: Start isIncluded. First operand 39 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 09:15:23,994 INFO L87 Difference]: Start difference. First operand 39 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 09:15:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:23,997 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 09:15:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 09:15:23,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:23,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:23,997 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 39 states. [2022-04-28 09:15:23,997 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 39 states. [2022-04-28 09:15:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:23,998 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 09:15:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 09:15:23,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:23,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:23,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:23,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:23,998 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 09:15:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-28 09:15:24,008 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2022-04-28 09:15:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:24,008 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-28 09:15:24,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 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 09:15:24,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-28 09:15:24,038 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 09:15:24,038 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 09:15:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 09:15:24,039 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:24,039 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:24,042 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 09:15:24,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:24,242 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:24,243 INFO L85 PathProgramCache]: Analyzing trace with hash -207089727, now seen corresponding path program 25 times [2022-04-28 09:15:24,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:24,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [237391431] [2022-04-28 09:15:24,246 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:24,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:24,246 INFO L85 PathProgramCache]: Analyzing trace with hash -207089727, now seen corresponding path program 26 times [2022-04-28 09:15:24,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:24,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439719592] [2022-04-28 09:15:24,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:24,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:24,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:24,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {6750#(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(14, 2);call #Ultimate.allocInit(12, 3); {6731#true} is VALID [2022-04-28 09:15:24,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {6731#true} assume true; {6731#true} is VALID [2022-04-28 09:15:24,470 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6731#true} {6731#true} #42#return; {6731#true} is VALID [2022-04-28 09:15:24,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {6731#true} call ULTIMATE.init(); {6750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:24,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {6750#(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(14, 2);call #Ultimate.allocInit(12, 3); {6731#true} is VALID [2022-04-28 09:15:24,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {6731#true} assume true; {6731#true} is VALID [2022-04-28 09:15:24,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6731#true} {6731#true} #42#return; {6731#true} is VALID [2022-04-28 09:15:24,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {6731#true} call #t~ret6 := main(); {6731#true} is VALID [2022-04-28 09:15:24,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {6731#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6736#(= main_~x~0 0)} is VALID [2022-04-28 09:15:24,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {6736#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {6736#(= main_~x~0 0)} is VALID [2022-04-28 09:15:24,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {6736#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:24,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {6737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:24,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {6737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:24,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {6738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:24,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {6738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:24,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {6739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {6739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:24,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {6739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:24,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {6740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:24,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {6740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:24,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {6741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:24,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {6741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:24,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {6742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:24,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {6742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:24,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {6743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {6743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:24,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {6743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:24,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {6744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:24,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {6744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:24,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {6745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:24,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {6745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:24,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {6746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:24,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {6746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:24,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {6747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {6747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:24,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {6747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:24,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {6748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:24,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {6748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6749#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-28 09:15:24,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {6749#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !(~x~0 % 4294967296 < 99); {6732#false} is VALID [2022-04-28 09:15:24,483 INFO L272 TraceCheckUtils]: 33: Hoare triple {6732#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6732#false} is VALID [2022-04-28 09:15:24,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {6732#false} ~cond := #in~cond; {6732#false} is VALID [2022-04-28 09:15:24,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {6732#false} assume 0 == ~cond; {6732#false} is VALID [2022-04-28 09:15:24,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {6732#false} assume !false; {6732#false} is VALID [2022-04-28 09:15:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:24,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:24,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439719592] [2022-04-28 09:15:24,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439719592] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:24,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511817386] [2022-04-28 09:15:24,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:15:24,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:24,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:24,484 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 09:15:24,490 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 09:15:24,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:15:24,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:24,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 09:15:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:24,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:24,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {6731#true} call ULTIMATE.init(); {6731#true} is VALID [2022-04-28 09:15:24,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {6731#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(14, 2);call #Ultimate.allocInit(12, 3); {6731#true} is VALID [2022-04-28 09:15:24,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {6731#true} assume true; {6731#true} is VALID [2022-04-28 09:15:24,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6731#true} {6731#true} #42#return; {6731#true} is VALID [2022-04-28 09:15:24,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {6731#true} call #t~ret6 := main(); {6731#true} is VALID [2022-04-28 09:15:24,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {6731#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6736#(= main_~x~0 0)} is VALID [2022-04-28 09:15:24,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {6736#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {6736#(= main_~x~0 0)} is VALID [2022-04-28 09:15:24,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {6736#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:24,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {6737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:24,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {6737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:24,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {6738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:24,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {6738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:24,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {6739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {6739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:24,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {6739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:24,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {6740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:24,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {6740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:24,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {6741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:24,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {6741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:24,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {6742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:24,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {6742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:24,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {6743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {6743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:24,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {6743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:24,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {6744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:24,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {6744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:24,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {6745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:24,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {6745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:24,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {6746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:24,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {6746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:24,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {6747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {6747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:24,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {6747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:24,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {6748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:24,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {6748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6847#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:24,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {6847#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {6732#false} is VALID [2022-04-28 09:15:24,901 INFO L272 TraceCheckUtils]: 33: Hoare triple {6732#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6732#false} is VALID [2022-04-28 09:15:24,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {6732#false} ~cond := #in~cond; {6732#false} is VALID [2022-04-28 09:15:24,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {6732#false} assume 0 == ~cond; {6732#false} is VALID [2022-04-28 09:15:24,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {6732#false} assume !false; {6732#false} is VALID [2022-04-28 09:15:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:24,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:25,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {6732#false} assume !false; {6732#false} is VALID [2022-04-28 09:15:25,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {6732#false} assume 0 == ~cond; {6732#false} is VALID [2022-04-28 09:15:25,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {6732#false} ~cond := #in~cond; {6732#false} is VALID [2022-04-28 09:15:25,368 INFO L272 TraceCheckUtils]: 33: Hoare triple {6732#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6732#false} is VALID [2022-04-28 09:15:25,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {6875#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {6732#false} is VALID [2022-04-28 09:15:25,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {6879#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6875#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:15:25,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {6879#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6879#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:25,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {6886#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6879#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:15:25,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {6886#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6886#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:25,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {6893#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6886#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:15:25,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {6893#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6893#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:15:25,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {6900#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6893#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:15:25,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {6900#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6900#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:15:25,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {6907#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6900#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:15:25,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {6907#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6907#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:15:25,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {6914#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6907#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:15:25,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {6914#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6914#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:15:25,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {6921#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6914#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:15:25,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {6921#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6921#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:15:25,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {6928#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6921#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:15:25,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {6928#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6928#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:15:25,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {6935#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6928#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:15:25,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {6935#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6935#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:15:25,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {6942#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6935#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:15:25,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {6942#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6942#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:15:25,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {6949#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6942#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:15:25,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {6949#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6949#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:15:25,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {6956#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6949#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:15:25,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {6956#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6956#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:15:25,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {6963#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6956#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:15:25,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {6963#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6963#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:15:25,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {6731#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6963#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:15:25,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {6731#true} call #t~ret6 := main(); {6731#true} is VALID [2022-04-28 09:15:25,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6731#true} {6731#true} #42#return; {6731#true} is VALID [2022-04-28 09:15:25,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {6731#true} assume true; {6731#true} is VALID [2022-04-28 09:15:25,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {6731#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(14, 2);call #Ultimate.allocInit(12, 3); {6731#true} is VALID [2022-04-28 09:15:25,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {6731#true} call ULTIMATE.init(); {6731#true} is VALID [2022-04-28 09:15:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:25,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511817386] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:25,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:25,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 09:15:25,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:25,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [237391431] [2022-04-28 09:15:25,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [237391431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:25,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:25,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 09:15:25,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546150338] [2022-04-28 09:15:25,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:25,383 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 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 09:15:25,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:25,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 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 09:15:25,409 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 09:15:25,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 09:15:25,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:25,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 09:15:25,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-28 09:15:25,410 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 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 09:15:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:26,244 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 09:15:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 09:15:26,244 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 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 09:15:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 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 09:15:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 46 transitions. [2022-04-28 09:15:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 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 09:15:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 46 transitions. [2022-04-28 09:15:26,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 46 transitions. [2022-04-28 09:15:26,282 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 09:15:26,283 INFO L225 Difference]: With dead ends: 46 [2022-04-28 09:15:26,283 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 09:15:26,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 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 09:15:26,284 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:26,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 58 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:15:26,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 09:15:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-04-28 09:15:26,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:26,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 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 09:15:26,366 INFO L74 IsIncluded]: Start isIncluded. First operand 41 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 09:15:26,366 INFO L87 Difference]: Start difference. First operand 41 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 09:15:26,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:26,367 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 09:15:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 09:15:26,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:26,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:26,367 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 41 states. [2022-04-28 09:15:26,367 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 41 states. [2022-04-28 09:15:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:26,368 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 09:15:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 09:15:26,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:26,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:26,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:26,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:26,368 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 09:15:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-28 09:15:26,369 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2022-04-28 09:15:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:26,369 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-28 09:15:26,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 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 09:15:26,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-28 09:15:26,412 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 09:15:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 09:15:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 09:15:26,412 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:26,412 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:26,428 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 09:15:26,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:26,613 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:26,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -402765826, now seen corresponding path program 27 times [2022-04-28 09:15:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:26,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220389750] [2022-04-28 09:15:26,616 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:26,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:26,616 INFO L85 PathProgramCache]: Analyzing trace with hash -402765826, now seen corresponding path program 28 times [2022-04-28 09:15:26,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:26,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393787489] [2022-04-28 09:15:26,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:26,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:26,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {7289#(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(14, 2);call #Ultimate.allocInit(12, 3); {7269#true} is VALID [2022-04-28 09:15:26,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {7269#true} assume true; {7269#true} is VALID [2022-04-28 09:15:26,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7269#true} {7269#true} #42#return; {7269#true} is VALID [2022-04-28 09:15:26,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {7269#true} call ULTIMATE.init(); {7289#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:26,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {7289#(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(14, 2);call #Ultimate.allocInit(12, 3); {7269#true} is VALID [2022-04-28 09:15:26,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {7269#true} assume true; {7269#true} is VALID [2022-04-28 09:15:26,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7269#true} {7269#true} #42#return; {7269#true} is VALID [2022-04-28 09:15:26,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {7269#true} call #t~ret6 := main(); {7269#true} is VALID [2022-04-28 09:15:26,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {7269#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {7274#(= main_~x~0 0)} is VALID [2022-04-28 09:15:26,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {7274#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {7274#(= main_~x~0 0)} is VALID [2022-04-28 09:15:26,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {7274#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7275#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:26,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {7275#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7275#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:26,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {7275#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7276#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:26,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {7276#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7276#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:26,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {7276#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7277#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:26,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {7277#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {7277#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:26,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {7277#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7278#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:26,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {7278#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7278#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:26,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {7278#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:26,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {7279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:26,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {7279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7280#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:26,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {7280#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7280#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:26,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {7280#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7281#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:26,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {7281#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {7281#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:26,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {7281#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7282#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:26,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {7282#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7282#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:26,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {7282#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:26,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {7283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:26,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {7283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7284#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:26,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {7284#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7284#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:26,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {7284#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7285#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:26,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {7285#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {7285#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:26,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {7285#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7286#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:26,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {7286#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7286#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:26,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {7286#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7287#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:26,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {7287#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7287#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:26,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {7287#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7288#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:26,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {7288#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 99); {7270#false} is VALID [2022-04-28 09:15:26,886 INFO L272 TraceCheckUtils]: 35: Hoare triple {7270#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7270#false} is VALID [2022-04-28 09:15:26,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {7270#false} ~cond := #in~cond; {7270#false} is VALID [2022-04-28 09:15:26,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {7270#false} assume 0 == ~cond; {7270#false} is VALID [2022-04-28 09:15:26,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {7270#false} assume !false; {7270#false} is VALID [2022-04-28 09:15:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:26,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:26,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393787489] [2022-04-28 09:15:26,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393787489] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:26,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509492885] [2022-04-28 09:15:26,887 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:15:26,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:26,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:26,908 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 09:15:26,908 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 09:15:26,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:15:26,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:26,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 09:15:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:26,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:27,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {7269#true} call ULTIMATE.init(); {7269#true} is VALID [2022-04-28 09:15:27,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {7269#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(14, 2);call #Ultimate.allocInit(12, 3); {7269#true} is VALID [2022-04-28 09:15:27,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {7269#true} assume true; {7269#true} is VALID [2022-04-28 09:15:27,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7269#true} {7269#true} #42#return; {7269#true} is VALID [2022-04-28 09:15:27,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {7269#true} call #t~ret6 := main(); {7269#true} is VALID [2022-04-28 09:15:27,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {7269#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {7274#(= main_~x~0 0)} is VALID [2022-04-28 09:15:27,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {7274#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {7274#(= main_~x~0 0)} is VALID [2022-04-28 09:15:27,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {7274#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7275#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:27,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {7275#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7275#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:27,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {7275#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7276#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:27,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {7276#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7276#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:27,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {7276#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7277#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:27,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {7277#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {7277#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:27,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {7277#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7278#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:27,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {7278#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7278#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:27,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {7278#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:27,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {7279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:27,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {7279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7280#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:27,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {7280#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7280#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:27,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {7280#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7281#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:27,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {7281#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {7281#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:27,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {7281#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7282#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:27,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {7282#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7282#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:27,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {7282#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:27,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {7283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:27,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {7283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7284#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:27,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {7284#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7284#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:27,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {7284#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7285#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:27,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {7285#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {7285#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:27,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {7285#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7286#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:27,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {7286#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7286#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:27,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {7286#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7287#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:27,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {7287#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7287#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:27,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {7287#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7392#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:27,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {7392#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {7392#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:27,751 INFO L272 TraceCheckUtils]: 35: Hoare triple {7392#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:27,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {7399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:27,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {7403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7270#false} is VALID [2022-04-28 09:15:27,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {7270#false} assume !false; {7270#false} is VALID [2022-04-28 09:15:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:27,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:28,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {7270#false} assume !false; {7270#false} is VALID [2022-04-28 09:15:28,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {7403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7270#false} is VALID [2022-04-28 09:15:28,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {7399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:28,101 INFO L272 TraceCheckUtils]: 35: Hoare triple {7419#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:28,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {7419#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {7419#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:28,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7419#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:28,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {7426#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {7269#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {7426#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:28,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {7269#true} call #t~ret6 := main(); {7269#true} is VALID [2022-04-28 09:15:28,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7269#true} {7269#true} #42#return; {7269#true} is VALID [2022-04-28 09:15:28,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {7269#true} assume true; {7269#true} is VALID [2022-04-28 09:15:28,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {7269#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(14, 2);call #Ultimate.allocInit(12, 3); {7269#true} is VALID [2022-04-28 09:15:28,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {7269#true} call ULTIMATE.init(); {7269#true} is VALID [2022-04-28 09:15:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-04-28 09:15:28,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509492885] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:28,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:28,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 6] total 23 [2022-04-28 09:15:28,112 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:28,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220389750] [2022-04-28 09:15:28,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220389750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:28,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:28,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 09:15:28,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803720461] [2022-04-28 09:15:28,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:28,113 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 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 09:15:28,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:28,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 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 09:15:28,132 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 09:15:28,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 09:15:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:28,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 09:15:28,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:15:28,132 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 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 09:15:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:28,871 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 09:15:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 09:15:28,871 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 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 09:15:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 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 09:15:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 48 transitions. [2022-04-28 09:15:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 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 09:15:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 48 transitions. [2022-04-28 09:15:28,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 48 transitions. [2022-04-28 09:15:28,897 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 09:15:28,897 INFO L225 Difference]: With dead ends: 48 [2022-04-28 09:15:28,897 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 09:15:28,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=1230, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 09:15:28,899 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:28,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 33 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:15:28,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 09:15:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-04-28 09:15:28,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:28,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 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 09:15:28,955 INFO L74 IsIncluded]: Start isIncluded. First operand 43 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 09:15:28,956 INFO L87 Difference]: Start difference. First operand 43 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 09:15:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:28,956 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 09:15:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 09:15:28,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:28,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:28,956 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 43 states. [2022-04-28 09:15:28,957 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 43 states. [2022-04-28 09:15:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:28,957 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 09:15:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 09:15:28,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:28,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:28,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:28,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:28,957 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 09:15:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-28 09:15:28,958 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2022-04-28 09:15:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:28,958 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-28 09:15:28,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 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 09:15:28,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-28 09:15:29,012 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 09:15:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 09:15:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 09:15:29,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:29,013 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:29,030 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 09:15:29,218 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,SelfDestructingSolverStorable23 [2022-04-28 09:15:29,218 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:29,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash 531064059, now seen corresponding path program 29 times [2022-04-28 09:15:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:29,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852603758] [2022-04-28 09:15:29,222 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:29,222 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash 531064059, now seen corresponding path program 30 times [2022-04-28 09:15:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:29,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969323125] [2022-04-28 09:15:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:29,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:29,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:29,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {7845#(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(14, 2);call #Ultimate.allocInit(12, 3); {7824#true} is VALID [2022-04-28 09:15:29,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {7824#true} assume true; {7824#true} is VALID [2022-04-28 09:15:29,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7824#true} {7824#true} #42#return; {7824#true} is VALID [2022-04-28 09:15:29,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {7824#true} call ULTIMATE.init(); {7845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:29,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {7845#(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(14, 2);call #Ultimate.allocInit(12, 3); {7824#true} is VALID [2022-04-28 09:15:29,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {7824#true} assume true; {7824#true} is VALID [2022-04-28 09:15:29,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7824#true} {7824#true} #42#return; {7824#true} is VALID [2022-04-28 09:15:29,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {7824#true} call #t~ret6 := main(); {7824#true} is VALID [2022-04-28 09:15:29,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {7824#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {7829#(= main_~x~0 0)} is VALID [2022-04-28 09:15:29,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {7829#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {7829#(= main_~x~0 0)} is VALID [2022-04-28 09:15:29,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {7829#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:29,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {7830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:29,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {7830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:29,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {7831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:29,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {7831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:29,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {7832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {7832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:29,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {7832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:29,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {7833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:29,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {7833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:29,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {7834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:29,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {7834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:29,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {7835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:29,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {7835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:29,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {7836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {7836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:29,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {7836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:29,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {7837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:29,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {7837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:29,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {7838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:29,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {7838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:29,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {7839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:29,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {7839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:29,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {7840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {7840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:29,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {7840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:29,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {7841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:29,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {7841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:29,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {7842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:29,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {7842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:29,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {7843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {7843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:29,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {7843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7844#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:29,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {7844#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {7825#false} is VALID [2022-04-28 09:15:29,543 INFO L272 TraceCheckUtils]: 37: Hoare triple {7825#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7825#false} is VALID [2022-04-28 09:15:29,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {7825#false} ~cond := #in~cond; {7825#false} is VALID [2022-04-28 09:15:29,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {7825#false} assume 0 == ~cond; {7825#false} is VALID [2022-04-28 09:15:29,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {7825#false} assume !false; {7825#false} is VALID [2022-04-28 09:15:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:29,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:29,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969323125] [2022-04-28 09:15:29,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969323125] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:29,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086413981] [2022-04-28 09:15:29,544 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:15:29,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:29,545 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 09:15:29,546 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 09:15:29,702 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 09:15:29,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:29,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 09:15:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:29,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:30,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {7824#true} call ULTIMATE.init(); {7824#true} is VALID [2022-04-28 09:15:30,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {7824#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(14, 2);call #Ultimate.allocInit(12, 3); {7824#true} is VALID [2022-04-28 09:15:30,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {7824#true} assume true; {7824#true} is VALID [2022-04-28 09:15:30,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7824#true} {7824#true} #42#return; {7824#true} is VALID [2022-04-28 09:15:30,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {7824#true} call #t~ret6 := main(); {7824#true} is VALID [2022-04-28 09:15:30,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {7824#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {7829#(= main_~x~0 0)} is VALID [2022-04-28 09:15:30,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {7829#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {7829#(= main_~x~0 0)} is VALID [2022-04-28 09:15:30,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {7829#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:30,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {7830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:30,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {7830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:30,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {7831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:30,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {7831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:30,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {7832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {7832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:30,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {7832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:30,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {7833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:30,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {7833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:30,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {7834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:30,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {7834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:30,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {7835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:30,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {7835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:30,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {7836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {7836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:30,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {7836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7912#(and (<= main_~x~0 16) (<= (mod main_~y~0 2) 0) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:30,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {7912#(and (<= main_~x~0 16) (<= (mod main_~y~0 2) 0) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7912#(and (<= main_~x~0 16) (<= (mod main_~y~0 2) 0) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:30,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {7912#(and (<= main_~x~0 16) (<= (mod main_~y~0 2) 0) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7919#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:30,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {7919#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7919#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:30,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {7919#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7926#(and (<= main_~x~0 20) (<= 20 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:30,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {7926#(and (<= main_~x~0 20) (<= 20 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {7926#(and (<= main_~x~0 20) (<= 20 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:30,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {7926#(and (<= main_~x~0 20) (<= 20 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7933#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:30,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {7933#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {7933#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:30,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {7933#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7940#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:30,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {7940#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {7940#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:30,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {7940#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7947#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:30,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {7947#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7947#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:30,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {7947#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7954#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:30,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {7954#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {7954#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:30,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {7954#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7961#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:30,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {7961#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {7961#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:30,616 INFO L272 TraceCheckUtils]: 37: Hoare triple {7961#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7968#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:30,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {7968#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7972#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:30,617 INFO L290 TraceCheckUtils]: 39: Hoare triple {7972#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7825#false} is VALID [2022-04-28 09:15:30,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {7825#false} assume !false; {7825#false} is VALID [2022-04-28 09:15:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:30,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:30,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {7825#false} assume !false; {7825#false} is VALID [2022-04-28 09:15:30,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {7972#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7825#false} is VALID [2022-04-28 09:15:30,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {7968#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7972#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:30,978 INFO L272 TraceCheckUtils]: 37: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7968#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:30,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7988#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:30,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {8037#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {7824#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {8037#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:30,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {7824#true} call #t~ret6 := main(); {7824#true} is VALID [2022-04-28 09:15:30,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7824#true} {7824#true} #42#return; {7824#true} is VALID [2022-04-28 09:15:30,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {7824#true} assume true; {7824#true} is VALID [2022-04-28 09:15:30,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {7824#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(14, 2);call #Ultimate.allocInit(12, 3); {7824#true} is VALID [2022-04-28 09:15:30,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {7824#true} call ULTIMATE.init(); {7824#true} is VALID [2022-04-28 09:15:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 09:15:30,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086413981] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:30,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:30,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 6] total 31 [2022-04-28 09:15:30,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:30,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852603758] [2022-04-28 09:15:30,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852603758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:30,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:30,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 09:15:30,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78789782] [2022-04-28 09:15:30,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:30,990 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 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 09:15:30,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:30,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 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 09:15:31,013 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 09:15:31,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 09:15:31,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:31,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 09:15:31,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:15:31,014 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 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 09:15:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:32,061 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 09:15:32,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 09:15:32,061 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 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 09:15:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 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 09:15:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 50 transitions. [2022-04-28 09:15:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 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 09:15:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 50 transitions. [2022-04-28 09:15:32,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 50 transitions. [2022-04-28 09:15:32,102 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 09:15:32,103 INFO L225 Difference]: With dead ends: 50 [2022-04-28 09:15:32,103 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 09:15:32,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 09:15:32,104 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:32,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 53 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:15:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 09:15:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-04-28 09:15:32,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:32,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 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 09:15:32,196 INFO L74 IsIncluded]: Start isIncluded. First operand 45 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 09:15:32,196 INFO L87 Difference]: Start difference. First operand 45 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 09:15:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:32,197 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 09:15:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 09:15:32,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:32,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:32,197 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 45 states. [2022-04-28 09:15:32,197 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 45 states. [2022-04-28 09:15:32,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:32,198 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 09:15:32,198 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 09:15:32,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:32,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:32,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:32,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:32,198 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 09:15:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-28 09:15:32,199 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2022-04-28 09:15:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:32,199 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-28 09:15:32,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 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 09:15:32,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-28 09:15:32,239 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 09:15:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 09:15:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 09:15:32,240 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:32,240 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:32,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 09:15:32,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 09:15:32,445 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:32,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash 293418680, now seen corresponding path program 31 times [2022-04-28 09:15:32,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:32,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1774897118] [2022-04-28 09:15:32,453 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:32,453 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:32,454 INFO L85 PathProgramCache]: Analyzing trace with hash 293418680, now seen corresponding path program 32 times [2022-04-28 09:15:32,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:32,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160031125] [2022-04-28 09:15:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:32,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:32,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:32,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {8435#(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(14, 2);call #Ultimate.allocInit(12, 3); {8413#true} is VALID [2022-04-28 09:15:32,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {8413#true} assume true; {8413#true} is VALID [2022-04-28 09:15:32,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8413#true} {8413#true} #42#return; {8413#true} is VALID [2022-04-28 09:15:32,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {8413#true} call ULTIMATE.init(); {8435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:32,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {8435#(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(14, 2);call #Ultimate.allocInit(12, 3); {8413#true} is VALID [2022-04-28 09:15:32,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {8413#true} assume true; {8413#true} is VALID [2022-04-28 09:15:32,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8413#true} {8413#true} #42#return; {8413#true} is VALID [2022-04-28 09:15:32,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {8413#true} call #t~ret6 := main(); {8413#true} is VALID [2022-04-28 09:15:32,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {8413#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {8418#(= main_~x~0 0)} is VALID [2022-04-28 09:15:32,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {8418#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {8418#(= main_~x~0 0)} is VALID [2022-04-28 09:15:32,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {8418#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8419#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:32,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {8419#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8419#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:32,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {8419#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8420#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:32,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {8420#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8420#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:32,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {8420#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8421#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:32,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {8421#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {8421#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:32,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {8421#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8422#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:32,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {8422#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8422#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:32,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {8422#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8423#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:32,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {8423#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8423#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:32,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {8423#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8424#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:32,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {8424#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8424#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:32,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {8424#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8425#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:32,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {8425#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {8425#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:32,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {8425#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8426#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:32,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {8426#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8426#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:32,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {8426#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8427#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:32,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {8427#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8427#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:32,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {8427#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8428#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:32,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {8428#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8428#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:32,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {8428#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8429#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:32,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {8429#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {8429#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:32,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {8429#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8430#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:32,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {8430#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8430#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:32,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {8430#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8431#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:32,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {8431#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8431#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:32,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {8431#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8432#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:32,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {8432#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {8432#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:32,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {8432#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8433#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:32,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {8433#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {8433#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:32,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {8433#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8434#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:32,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {8434#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {8414#false} is VALID [2022-04-28 09:15:32,739 INFO L272 TraceCheckUtils]: 39: Hoare triple {8414#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8414#false} is VALID [2022-04-28 09:15:32,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {8414#false} ~cond := #in~cond; {8414#false} is VALID [2022-04-28 09:15:32,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {8414#false} assume 0 == ~cond; {8414#false} is VALID [2022-04-28 09:15:32,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {8414#false} assume !false; {8414#false} is VALID [2022-04-28 09:15:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:32,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:32,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160031125] [2022-04-28 09:15:32,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160031125] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:32,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326952509] [2022-04-28 09:15:32,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:15:32,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:32,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:32,740 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 09:15:32,741 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 09:15:32,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:15:32,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:32,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 09:15:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:32,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:33,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {8413#true} call ULTIMATE.init(); {8413#true} is VALID [2022-04-28 09:15:33,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {8413#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(14, 2);call #Ultimate.allocInit(12, 3); {8413#true} is VALID [2022-04-28 09:15:33,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {8413#true} assume true; {8413#true} is VALID [2022-04-28 09:15:33,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8413#true} {8413#true} #42#return; {8413#true} is VALID [2022-04-28 09:15:33,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {8413#true} call #t~ret6 := main(); {8413#true} is VALID [2022-04-28 09:15:33,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {8413#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {8418#(= main_~x~0 0)} is VALID [2022-04-28 09:15:33,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {8418#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {8418#(= main_~x~0 0)} is VALID [2022-04-28 09:15:33,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {8418#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8460#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:15:33,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {8460#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8460#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:15:33,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {8460#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8467#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-28 09:15:33,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {8467#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {8467#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-28 09:15:33,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {8467#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8474#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:15:33,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {8474#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {8474#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:15:33,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {8474#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8481#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {8481#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {8481#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {8481#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8488#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:15:33,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {8488#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < 99); {8488#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:15:33,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {8488#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8495#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {8495#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {8495#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {8495#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8502#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {8502#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {8502#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {8502#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8509#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {8509#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {8509#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {8509#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8516#(and (= 14 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {8516#(and (= 14 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {8516#(and (= 14 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {8516#(and (= 14 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8523#(and (<= (mod main_~y~0 2) 0) (= 14 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:15:33,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {8523#(and (<= (mod main_~y~0 2) 0) (= 14 (+ main_~x~0 (- 6))))} assume !!(~x~0 % 4294967296 < 99); {8523#(and (<= (mod main_~y~0 2) 0) (= 14 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:15:33,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {8523#(and (<= (mod main_~y~0 2) 0) (= 14 (+ main_~x~0 (- 6))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8530#(and (= 14 (+ main_~x~0 (- 8))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {8530#(and (= 14 (+ main_~x~0 (- 8))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {8530#(and (= 14 (+ main_~x~0 (- 8))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {8530#(and (= 14 (+ main_~x~0 (- 8))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8537#(and (= (+ main_~x~0 (- 10)) 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {8537#(and (= (+ main_~x~0 (- 10)) 14) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {8537#(and (= (+ main_~x~0 (- 10)) 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {8537#(and (= (+ main_~x~0 (- 10)) 14) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8544#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:15:33,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {8544#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 99); {8544#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:15:33,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {8544#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8551#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {8551#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {8551#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {8551#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8558#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:15:33,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {8558#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8558#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:15:33,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {8558#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8565#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,301 INFO L290 TraceCheckUtils]: 38: Hoare triple {8565#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {8565#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:33,301 INFO L272 TraceCheckUtils]: 39: Hoare triple {8565#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:33,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {8572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:33,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {8576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8414#false} is VALID [2022-04-28 09:15:33,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {8414#false} assume !false; {8414#false} is VALID [2022-04-28 09:15:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:33,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:33,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {8414#false} assume !false; {8414#false} is VALID [2022-04-28 09:15:33,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {8576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8414#false} is VALID [2022-04-28 09:15:33,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {8572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:33,562 INFO L272 TraceCheckUtils]: 39: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:33,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {8689#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8592#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:33,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {8689#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {8689#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:33,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {8413#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {8689#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:33,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {8413#true} call #t~ret6 := main(); {8413#true} is VALID [2022-04-28 09:15:33,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8413#true} {8413#true} #42#return; {8413#true} is VALID [2022-04-28 09:15:33,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {8413#true} assume true; {8413#true} is VALID [2022-04-28 09:15:33,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {8413#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(14, 2);call #Ultimate.allocInit(12, 3); {8413#true} is VALID [2022-04-28 09:15:33,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {8413#true} call ULTIMATE.init(); {8413#true} is VALID [2022-04-28 09:15:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-04-28 09:15:33,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326952509] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:33,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:33,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 6] total 40 [2022-04-28 09:15:33,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:33,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1774897118] [2022-04-28 09:15:33,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1774897118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:33,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:33,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 09:15:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189254344] [2022-04-28 09:15:33,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:33,582 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 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 09:15:33,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:33,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 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 09:15:33,603 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 09:15:33,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 09:15:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:33,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 09:15:33,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 09:15:33,606 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 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 09:15:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:34,584 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 09:15:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 09:15:34,584 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 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 09:15:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 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 09:15:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 52 transitions. [2022-04-28 09:15:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 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 09:15:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 52 transitions. [2022-04-28 09:15:34,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 52 transitions. [2022-04-28 09:15:34,613 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 09:15:34,614 INFO L225 Difference]: With dead ends: 52 [2022-04-28 09:15:34,614 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 09:15:34,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=288, Invalid=2904, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 09:15:34,615 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:34,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 43 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:15:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 09:15:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-28 09:15:34,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:34,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 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 09:15:34,685 INFO L74 IsIncluded]: Start isIncluded. First operand 47 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 09:15:34,685 INFO L87 Difference]: Start difference. First operand 47 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 09:15:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:34,685 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 09:15:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 09:15:34,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:34,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:34,699 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 47 states. [2022-04-28 09:15:34,699 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 47 states. [2022-04-28 09:15:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:34,700 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 09:15:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 09:15:34,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:34,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:34,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:34,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:34,702 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 09:15:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-28 09:15:34,703 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2022-04-28 09:15:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:34,703 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-28 09:15:34,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 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 09:15:34,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-28 09:15:34,742 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 09:15:34,742 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 09:15:34,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 09:15:34,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:34,743 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:34,759 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 09:15:34,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 09:15:34,959 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:34,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:34,959 INFO L85 PathProgramCache]: Analyzing trace with hash -450523851, now seen corresponding path program 33 times [2022-04-28 09:15:34,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:34,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1475208963] [2022-04-28 09:15:34,961 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:34,961 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash -450523851, now seen corresponding path program 34 times [2022-04-28 09:15:34,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:34,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365179877] [2022-04-28 09:15:34,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:34,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:35,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {9060#(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(14, 2);call #Ultimate.allocInit(12, 3); {9037#true} is VALID [2022-04-28 09:15:35,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {9037#true} assume true; {9037#true} is VALID [2022-04-28 09:15:35,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9037#true} {9037#true} #42#return; {9037#true} is VALID [2022-04-28 09:15:35,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {9037#true} call ULTIMATE.init(); {9060#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:35,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {9060#(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(14, 2);call #Ultimate.allocInit(12, 3); {9037#true} is VALID [2022-04-28 09:15:35,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {9037#true} assume true; {9037#true} is VALID [2022-04-28 09:15:35,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9037#true} {9037#true} #42#return; {9037#true} is VALID [2022-04-28 09:15:35,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {9037#true} call #t~ret6 := main(); {9037#true} is VALID [2022-04-28 09:15:35,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {9037#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {9042#(= main_~x~0 0)} is VALID [2022-04-28 09:15:35,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {9042#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {9042#(= main_~x~0 0)} is VALID [2022-04-28 09:15:35,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {9042#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9043#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:35,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {9043#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {9043#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:35,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {9043#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9044#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:35,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {9044#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9044#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:35,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {9044#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9045#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:35,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {9045#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {9045#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:35,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {9045#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9046#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:35,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {9046#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9046#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:35,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {9046#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9047#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:35,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {9047#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9047#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:35,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {9047#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9048#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:35,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {9048#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9048#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:35,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {9048#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9049#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:35,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {9049#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {9049#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:35,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {9049#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9050#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:35,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {9050#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9050#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:35,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {9050#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9051#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:35,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {9051#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9051#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:35,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {9051#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9052#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:35,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {9052#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9052#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:35,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {9052#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9053#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:35,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {9053#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {9053#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:35,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {9053#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9054#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:35,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {9054#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9054#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:35,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {9054#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9055#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:35,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {9055#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9055#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:35,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {9055#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9056#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:35,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {9056#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {9056#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:35,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {9056#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9057#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:35,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {9057#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {9057#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:35,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {9057#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9058#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:35,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {9058#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9058#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:35,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {9058#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9059#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:35,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {9059#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {9038#false} is VALID [2022-04-28 09:15:35,241 INFO L272 TraceCheckUtils]: 41: Hoare triple {9038#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9038#false} is VALID [2022-04-28 09:15:35,241 INFO L290 TraceCheckUtils]: 42: Hoare triple {9038#false} ~cond := #in~cond; {9038#false} is VALID [2022-04-28 09:15:35,241 INFO L290 TraceCheckUtils]: 43: Hoare triple {9038#false} assume 0 == ~cond; {9038#false} is VALID [2022-04-28 09:15:35,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {9038#false} assume !false; {9038#false} is VALID [2022-04-28 09:15:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:35,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:35,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365179877] [2022-04-28 09:15:35,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365179877] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:35,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508855238] [2022-04-28 09:15:35,241 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:15:35,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:35,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:35,243 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 09:15:35,245 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 09:15:35,273 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:15:35,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:35,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 09:15:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:35,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:36,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {9037#true} call ULTIMATE.init(); {9037#true} is VALID [2022-04-28 09:15:36,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {9037#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(14, 2);call #Ultimate.allocInit(12, 3); {9037#true} is VALID [2022-04-28 09:15:36,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {9037#true} assume true; {9037#true} is VALID [2022-04-28 09:15:36,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9037#true} {9037#true} #42#return; {9037#true} is VALID [2022-04-28 09:15:36,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {9037#true} call #t~ret6 := main(); {9037#true} is VALID [2022-04-28 09:15:36,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {9037#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {9042#(= main_~x~0 0)} is VALID [2022-04-28 09:15:36,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {9042#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {9042#(= main_~x~0 0)} is VALID [2022-04-28 09:15:36,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {9042#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9085#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {9085#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9085#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {9085#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9092#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-28 09:15:36,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {9092#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {9092#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-28 09:15:36,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {9092#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9099#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {9099#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9099#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {9099#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9106#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:15:36,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {9106#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {9106#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:15:36,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {9106#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9113#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {9113#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9113#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {9113#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9120#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {9120#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9120#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {9120#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9127#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {9127#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9127#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {9127#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9134#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} is VALID [2022-04-28 09:15:36,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {9134#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} assume !!(~x~0 % 4294967296 < 99); {9134#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} is VALID [2022-04-28 09:15:36,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {9134#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9141#(and (<= (mod main_~y~0 2) 0) (= 12 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:15:36,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {9141#(and (<= (mod main_~y~0 2) 0) (= 12 (+ main_~x~0 (- 6))))} assume !!(~x~0 % 4294967296 < 99); {9141#(and (<= (mod main_~y~0 2) 0) (= 12 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:15:36,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {9141#(and (<= (mod main_~y~0 2) 0) (= 12 (+ main_~x~0 (- 6))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9148#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {9148#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9148#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {9148#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9155#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {9155#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9155#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {9155#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9162#(and (= (+ main_~x~0 (- 4)) 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {9162#(and (= (+ main_~x~0 (- 4)) 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9162#(and (= (+ main_~x~0 (- 4)) 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {9162#(and (= (+ main_~x~0 (- 4)) 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9169#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:15:36,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {9169#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 99); {9169#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:15:36,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {9169#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9176#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {9176#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9176#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {9176#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9183#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:15:36,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {9183#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9183#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:15:36,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {9183#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9190#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {9190#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9190#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {9190#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9197#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {9197#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {9197#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:36,020 INFO L272 TraceCheckUtils]: 41: Hoare triple {9197#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:36,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {9204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:36,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {9208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9038#false} is VALID [2022-04-28 09:15:36,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {9038#false} assume !false; {9038#false} is VALID [2022-04-28 09:15:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:36,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:36,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {9038#false} assume !false; {9038#false} is VALID [2022-04-28 09:15:36,347 INFO L290 TraceCheckUtils]: 43: Hoare triple {9208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9038#false} is VALID [2022-04-28 09:15:36,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {9204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:36,348 INFO L272 TraceCheckUtils]: 41: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:36,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,350 INFO L290 TraceCheckUtils]: 34: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {9327#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9224#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:36,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {9327#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {9327#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:36,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {9037#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {9327#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:36,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {9037#true} call #t~ret6 := main(); {9037#true} is VALID [2022-04-28 09:15:36,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9037#true} {9037#true} #42#return; {9037#true} is VALID [2022-04-28 09:15:36,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {9037#true} assume true; {9037#true} is VALID [2022-04-28 09:15:36,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {9037#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(14, 2);call #Ultimate.allocInit(12, 3); {9037#true} is VALID [2022-04-28 09:15:36,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {9037#true} call ULTIMATE.init(); {9037#true} is VALID [2022-04-28 09:15:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-28 09:15:36,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508855238] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:36,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:36,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 6] total 42 [2022-04-28 09:15:36,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:36,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1475208963] [2022-04-28 09:15:36,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1475208963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:36,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:36,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 09:15:36,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503662386] [2022-04-28 09:15:36,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:36,364 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 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 09:15:36,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:36,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 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 09:15:36,397 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 09:15:36,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 09:15:36,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:36,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 09:15:36,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1540, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 09:15:36,399 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 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 09:15:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:37,434 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 09:15:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 09:15:37,434 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 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 09:15:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 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 09:15:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 54 transitions. [2022-04-28 09:15:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 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 09:15:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 54 transitions. [2022-04-28 09:15:37,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 54 transitions. [2022-04-28 09:15:37,464 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 09:15:37,465 INFO L225 Difference]: With dead ends: 54 [2022-04-28 09:15:37,465 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 09:15:37,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=3235, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 09:15:37,466 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:37,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 73 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:15:37,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 09:15:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2022-04-28 09:15:37,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:37,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 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 09:15:37,543 INFO L74 IsIncluded]: Start isIncluded. First operand 49 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 09:15:37,543 INFO L87 Difference]: Start difference. First operand 49 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 09:15:37,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:37,544 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 09:15:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 09:15:37,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:37,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:37,544 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 49 states. [2022-04-28 09:15:37,544 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 49 states. [2022-04-28 09:15:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:37,545 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 09:15:37,545 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 09:15:37,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:37,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:37,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:37,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:37,545 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 09:15:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-28 09:15:37,546 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2022-04-28 09:15:37,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:37,546 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-28 09:15:37,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 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 09:15:37,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-28 09:15:37,588 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 09:15:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 09:15:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 09:15:37,588 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:37,589 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:37,607 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 09:15:37,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:37,789 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:37,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:37,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1880242290, now seen corresponding path program 35 times [2022-04-28 09:15:37,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:37,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1127998562] [2022-04-28 09:15:37,792 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:37,792 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1880242290, now seen corresponding path program 36 times [2022-04-28 09:15:37,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:37,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660855006] [2022-04-28 09:15:37,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:38,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:38,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {9713#(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(14, 2);call #Ultimate.allocInit(12, 3); {9689#true} is VALID [2022-04-28 09:15:38,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {9689#true} assume true; {9689#true} is VALID [2022-04-28 09:15:38,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9689#true} {9689#true} #42#return; {9689#true} is VALID [2022-04-28 09:15:38,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {9689#true} call ULTIMATE.init(); {9713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:38,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {9713#(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(14, 2);call #Ultimate.allocInit(12, 3); {9689#true} is VALID [2022-04-28 09:15:38,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {9689#true} assume true; {9689#true} is VALID [2022-04-28 09:15:38,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9689#true} {9689#true} #42#return; {9689#true} is VALID [2022-04-28 09:15:38,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {9689#true} call #t~ret6 := main(); {9689#true} is VALID [2022-04-28 09:15:38,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {9689#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {9694#(= main_~x~0 0)} is VALID [2022-04-28 09:15:38,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {9694#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {9694#(= main_~x~0 0)} is VALID [2022-04-28 09:15:38,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {9694#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9695#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:38,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {9695#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {9695#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:38,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {9695#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9696#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:38,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {9696#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9696#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:38,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {9696#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9697#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:38,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {9697#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {9697#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:38,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {9697#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9698#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:38,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {9698#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9698#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:38,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {9698#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9699#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:38,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {9699#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9699#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:38,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {9699#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9700#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:38,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {9700#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9700#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:38,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {9700#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9701#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:38,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {9701#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {9701#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:38,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {9701#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9702#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:38,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {9702#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9702#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:38,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {9702#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9703#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:38,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {9703#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9703#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:38,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {9703#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9704#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:38,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {9704#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9704#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:38,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {9704#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9705#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:38,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {9705#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {9705#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:38,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {9705#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9706#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:38,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {9706#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9706#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:38,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {9706#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9707#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:38,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {9707#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9707#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:38,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {9707#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9708#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:38,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {9708#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {9708#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:38,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {9708#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9709#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:38,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {9709#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {9709#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:38,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {9709#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9710#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:38,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {9710#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9710#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:38,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {9710#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9711#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:15:38,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {9711#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9711#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:15:38,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {9711#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9712#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:38,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {9712#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {9690#false} is VALID [2022-04-28 09:15:38,122 INFO L272 TraceCheckUtils]: 43: Hoare triple {9690#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9690#false} is VALID [2022-04-28 09:15:38,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {9690#false} ~cond := #in~cond; {9690#false} is VALID [2022-04-28 09:15:38,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {9690#false} assume 0 == ~cond; {9690#false} is VALID [2022-04-28 09:15:38,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {9690#false} assume !false; {9690#false} is VALID [2022-04-28 09:15:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:38,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:38,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660855006] [2022-04-28 09:15:38,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660855006] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:38,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038639833] [2022-04-28 09:15:38,123 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:15:38,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:38,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:38,124 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 09:15:38,125 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 09:15:38,315 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 09:15:38,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:38,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 09:15:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:38,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:39,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {9689#true} call ULTIMATE.init(); {9689#true} is VALID [2022-04-28 09:15:39,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {9689#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(14, 2);call #Ultimate.allocInit(12, 3); {9689#true} is VALID [2022-04-28 09:15:39,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {9689#true} assume true; {9689#true} is VALID [2022-04-28 09:15:39,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9689#true} {9689#true} #42#return; {9689#true} is VALID [2022-04-28 09:15:39,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {9689#true} call #t~ret6 := main(); {9689#true} is VALID [2022-04-28 09:15:39,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {9689#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {9694#(= main_~x~0 0)} is VALID [2022-04-28 09:15:39,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {9694#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {9694#(= main_~x~0 0)} is VALID [2022-04-28 09:15:39,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {9694#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9695#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:39,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {9695#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {9695#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:39,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {9695#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9696#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:39,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {9696#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9696#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:39,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {9696#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9697#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:39,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {9697#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {9697#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:39,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {9697#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9698#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:39,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {9698#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9698#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:39,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {9698#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9699#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:39,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {9699#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9699#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:39,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {9699#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9700#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:39,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {9700#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9700#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:39,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {9700#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9701#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:39,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {9701#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {9701#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:39,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {9701#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9702#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:39,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {9702#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9702#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:39,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {9702#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9786#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:39,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {9786#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9786#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:39,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {9786#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9793#(and (<= main_~x~0 20) (<= 20 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:39,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {9793#(and (<= main_~x~0 20) (<= 20 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9793#(and (<= main_~x~0 20) (<= 20 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:39,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {9793#(and (<= main_~x~0 20) (<= 20 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9800#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:39,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {9800#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {9800#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:39,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {9800#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9807#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:39,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {9807#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9807#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:39,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {9807#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9814#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:39,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {9814#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9814#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:39,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {9814#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9821#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:39,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {9821#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9821#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:39,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {9821#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9828#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:39,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {9828#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9828#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:39,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {9828#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9835#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:39,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {9835#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9835#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:39,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {9835#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9842#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:39,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {9842#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {9842#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:39,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {9842#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9849#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:39,260 INFO L290 TraceCheckUtils]: 42: Hoare triple {9849#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {9849#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:39,260 INFO L272 TraceCheckUtils]: 43: Hoare triple {9849#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9856#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:39,261 INFO L290 TraceCheckUtils]: 44: Hoare triple {9856#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9860#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:39,261 INFO L290 TraceCheckUtils]: 45: Hoare triple {9860#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9690#false} is VALID [2022-04-28 09:15:39,261 INFO L290 TraceCheckUtils]: 46: Hoare triple {9690#false} assume !false; {9690#false} is VALID [2022-04-28 09:15:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:39,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:39,625 INFO L290 TraceCheckUtils]: 46: Hoare triple {9690#false} assume !false; {9690#false} is VALID [2022-04-28 09:15:39,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {9860#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9690#false} is VALID [2022-04-28 09:15:39,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {9856#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9860#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:39,626 INFO L272 TraceCheckUtils]: 43: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9856#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:39,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,628 INFO L290 TraceCheckUtils]: 39: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,629 INFO L290 TraceCheckUtils]: 35: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9876#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:39,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {9937#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {9689#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {9937#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:39,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {9689#true} call #t~ret6 := main(); {9689#true} is VALID [2022-04-28 09:15:39,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9689#true} {9689#true} #42#return; {9689#true} is VALID [2022-04-28 09:15:39,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {9689#true} assume true; {9689#true} is VALID [2022-04-28 09:15:39,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {9689#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(14, 2);call #Ultimate.allocInit(12, 3); {9689#true} is VALID [2022-04-28 09:15:39,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {9689#true} call ULTIMATE.init(); {9689#true} is VALID [2022-04-28 09:15:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-28 09:15:39,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038639833] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:39,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:39,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 6] total 36 [2022-04-28 09:15:39,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:39,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1127998562] [2022-04-28 09:15:39,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1127998562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:39,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:39,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 09:15:39,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467344654] [2022-04-28 09:15:39,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:39,655 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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 09:15:39,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:39,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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 09:15:39,688 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 09:15:39,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 09:15:39,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:39,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 09:15:39,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 09:15:39,689 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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 09:15:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:40,973 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 09:15:40,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 09:15:40,973 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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 09:15:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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 09:15:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 56 transitions. [2022-04-28 09:15:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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 09:15:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 56 transitions. [2022-04-28 09:15:40,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 56 transitions. [2022-04-28 09:15:41,019 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 09:15:41,020 INFO L225 Difference]: With dead ends: 56 [2022-04-28 09:15:41,020 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 09:15:41,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=2696, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 09:15:41,021 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:41,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 78 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 09:15:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 09:15:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 09:15:41,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:41,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 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 09:15:41,154 INFO L74 IsIncluded]: Start isIncluded. First operand 51 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 09:15:41,154 INFO L87 Difference]: Start difference. First operand 51 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 09:15:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:41,155 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 09:15:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 09:15:41,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:41,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:41,155 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 51 states. [2022-04-28 09:15:41,155 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 51 states. [2022-04-28 09:15:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:41,156 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 09:15:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 09:15:41,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:41,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:41,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:41,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:41,156 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 09:15:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-28 09:15:41,157 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2022-04-28 09:15:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:41,157 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-28 09:15:41,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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 09:15:41,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-28 09:15:41,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 09:15:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 09:15:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 09:15:41,216 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:41,216 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:41,220 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 09:15:41,416 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,SelfDestructingSolverStorable27 [2022-04-28 09:15:41,416 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:41,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:41,417 INFO L85 PathProgramCache]: Analyzing trace with hash -226424721, now seen corresponding path program 37 times [2022-04-28 09:15:41,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:41,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [748729020] [2022-04-28 09:15:41,419 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:41,419 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash -226424721, now seen corresponding path program 38 times [2022-04-28 09:15:41,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:41,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611170515] [2022-04-28 09:15:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:41,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:41,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:41,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {10386#(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(14, 2);call #Ultimate.allocInit(12, 3); {10361#true} is VALID [2022-04-28 09:15:41,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {10361#true} assume true; {10361#true} is VALID [2022-04-28 09:15:41,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10361#true} {10361#true} #42#return; {10361#true} is VALID [2022-04-28 09:15:41,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {10361#true} call ULTIMATE.init(); {10386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:41,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {10386#(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(14, 2);call #Ultimate.allocInit(12, 3); {10361#true} is VALID [2022-04-28 09:15:41,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {10361#true} assume true; {10361#true} is VALID [2022-04-28 09:15:41,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10361#true} {10361#true} #42#return; {10361#true} is VALID [2022-04-28 09:15:41,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {10361#true} call #t~ret6 := main(); {10361#true} is VALID [2022-04-28 09:15:41,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {10361#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {10366#(= main_~x~0 0)} is VALID [2022-04-28 09:15:41,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {10366#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {10366#(= main_~x~0 0)} is VALID [2022-04-28 09:15:41,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {10366#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10367#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:41,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {10367#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {10367#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:41,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {10367#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10368#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:41,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {10368#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10368#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:41,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {10368#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10369#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:41,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {10369#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {10369#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:41,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {10369#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:41,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {10370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:41,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {10370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10371#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:41,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {10371#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10371#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:41,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {10371#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10372#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:41,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {10372#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10372#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:41,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {10372#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10373#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:41,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {10373#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {10373#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:41,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {10373#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10374#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:41,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {10374#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10374#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:41,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {10374#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10375#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:41,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {10375#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10375#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:41,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {10375#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10376#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:41,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {10376#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10376#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:41,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {10376#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10377#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:41,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {10377#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {10377#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:41,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {10377#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10378#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:41,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {10378#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10378#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:41,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {10378#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10379#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:41,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {10379#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10379#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:41,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {10379#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10380#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:41,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {10380#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {10380#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:41,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {10380#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10381#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:41,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {10381#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {10381#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:41,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {10381#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10382#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:41,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {10382#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10382#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:41,806 INFO L290 TraceCheckUtils]: 39: Hoare triple {10382#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10383#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:15:41,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {10383#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10383#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:15:41,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {10383#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10384#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:15:41,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {10384#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10384#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:15:41,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {10384#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10385#(and (<= main_~x~0 38) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:41,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {10385#(and (<= main_~x~0 38) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {10362#false} is VALID [2022-04-28 09:15:41,808 INFO L272 TraceCheckUtils]: 45: Hoare triple {10362#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10362#false} is VALID [2022-04-28 09:15:41,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {10362#false} ~cond := #in~cond; {10362#false} is VALID [2022-04-28 09:15:41,809 INFO L290 TraceCheckUtils]: 47: Hoare triple {10362#false} assume 0 == ~cond; {10362#false} is VALID [2022-04-28 09:15:41,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {10362#false} assume !false; {10362#false} is VALID [2022-04-28 09:15:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:41,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:41,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611170515] [2022-04-28 09:15:41,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611170515] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:41,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948505161] [2022-04-28 09:15:41,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:15:41,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:41,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:41,810 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 09:15:41,811 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 09:15:41,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:15:41,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:41,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 09:15:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:41,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:42,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {10361#true} call ULTIMATE.init(); {10361#true} is VALID [2022-04-28 09:15:42,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {10361#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(14, 2);call #Ultimate.allocInit(12, 3); {10361#true} is VALID [2022-04-28 09:15:42,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {10361#true} assume true; {10361#true} is VALID [2022-04-28 09:15:42,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10361#true} {10361#true} #42#return; {10361#true} is VALID [2022-04-28 09:15:42,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {10361#true} call #t~ret6 := main(); {10361#true} is VALID [2022-04-28 09:15:42,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {10361#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {10366#(= main_~x~0 0)} is VALID [2022-04-28 09:15:42,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {10366#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {10366#(= main_~x~0 0)} is VALID [2022-04-28 09:15:42,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {10366#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10411#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {10411#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {10411#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {10411#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10418#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:15:42,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {10418#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume !!(~x~0 % 4294967296 < 99); {10418#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:15:42,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {10418#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10425#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:15:42,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {10425#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {10425#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:15:42,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {10425#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10432#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:15:42,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {10432#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {10432#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:15:42,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {10432#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10439#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {10439#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {10439#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {10439#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10446#(and (= (+ main_~x~0 (- 4)) 8) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {10446#(and (= (+ main_~x~0 (- 4)) 8) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {10446#(and (= (+ main_~x~0 (- 4)) 8) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {10446#(and (= (+ main_~x~0 (- 4)) 8) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10453#(and (<= (mod main_~y~0 2) 0) (= 8 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:15:42,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {10453#(and (<= (mod main_~y~0 2) 0) (= 8 (+ main_~x~0 (- 6))))} assume !!(~x~0 % 4294967296 < 99); {10453#(and (<= (mod main_~y~0 2) 0) (= 8 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:15:42,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {10453#(and (<= (mod main_~y~0 2) 0) (= 8 (+ main_~x~0 (- 6))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10460#(and (= (+ main_~x~0 (- 8)) 8) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {10460#(and (= (+ main_~x~0 (- 8)) 8) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {10460#(and (= (+ main_~x~0 (- 8)) 8) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {10460#(and (= (+ main_~x~0 (- 8)) 8) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10467#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {10467#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {10467#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {10467#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10474#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {10474#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {10474#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {10474#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10481#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {10481#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {10481#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {10481#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10488#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {10488#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {10488#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {10488#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10495#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:15:42,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {10495#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 99); {10495#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:15:42,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {10495#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10502#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {10502#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {10502#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {10502#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10509#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:15:42,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {10509#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10509#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:15:42,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {10509#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10516#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {10516#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {10516#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {10516#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10523#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {10523#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {10523#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {10523#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10530#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:15:42,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {10530#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume !!(~x~0 % 4294967296 < 99); {10530#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:15:42,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {10530#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10537#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {10537#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {10537#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:42,673 INFO L272 TraceCheckUtils]: 45: Hoare triple {10537#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10544#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:42,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {10544#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10548#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:42,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {10548#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10362#false} is VALID [2022-04-28 09:15:42,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {10362#false} assume !false; {10362#false} is VALID [2022-04-28 09:15:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:42,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:43,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {10362#false} assume !false; {10362#false} is VALID [2022-04-28 09:15:43,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {10548#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10362#false} is VALID [2022-04-28 09:15:43,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {10544#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10548#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:43,076 INFO L272 TraceCheckUtils]: 45: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10544#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:43,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {10679#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {10564#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:43,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {10679#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {10679#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:43,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {10361#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {10679#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:43,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {10361#true} call #t~ret6 := main(); {10361#true} is VALID [2022-04-28 09:15:43,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10361#true} {10361#true} #42#return; {10361#true} is VALID [2022-04-28 09:15:43,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {10361#true} assume true; {10361#true} is VALID [2022-04-28 09:15:43,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {10361#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(14, 2);call #Ultimate.allocInit(12, 3); {10361#true} is VALID [2022-04-28 09:15:43,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {10361#true} call ULTIMATE.init(); {10361#true} is VALID [2022-04-28 09:15:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-28 09:15:43,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948505161] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:43,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:43,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 6] total 46 [2022-04-28 09:15:43,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:43,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [748729020] [2022-04-28 09:15:43,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [748729020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:43,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:43,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 09:15:43,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335744192] [2022-04-28 09:15:43,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:43,094 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 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 09:15:43,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:43,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 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 09:15:43,137 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 09:15:43,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 09:15:43,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:43,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 09:15:43,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1868, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 09:15:43,138 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 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 09:15:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:44,748 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 09:15:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 09:15:44,749 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 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 09:15:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 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 09:15:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 58 transitions. [2022-04-28 09:15:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 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 09:15:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 58 transitions. [2022-04-28 09:15:44,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 58 transitions. [2022-04-28 09:15:44,797 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 09:15:44,797 INFO L225 Difference]: With dead ends: 58 [2022-04-28 09:15:44,797 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 09:15:44,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=339, Invalid=3951, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 09:15:44,799 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:44,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 68 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 09:15:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 09:15:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-28 09:15:44,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:44,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 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 09:15:44,942 INFO L74 IsIncluded]: Start isIncluded. First operand 53 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 09:15:44,943 INFO L87 Difference]: Start difference. First operand 53 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 09:15:44,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:44,943 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 09:15:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 09:15:44,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:44,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:44,944 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 53 states. [2022-04-28 09:15:44,944 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 53 states. [2022-04-28 09:15:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:44,944 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 09:15:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 09:15:44,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:44,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:44,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:44,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:44,945 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 09:15:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-28 09:15:44,945 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2022-04-28 09:15:44,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:44,946 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-28 09:15:44,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 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 09:15:44,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-28 09:15:45,005 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 09:15:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 09:15:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 09:15:45,006 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:45,006 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:45,022 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 09:15:45,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 09:15:45,207 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:45,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1803825876, now seen corresponding path program 39 times [2022-04-28 09:15:45,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:45,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1305355429] [2022-04-28 09:15:45,210 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:45,211 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:45,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1803825876, now seen corresponding path program 40 times [2022-04-28 09:15:45,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:45,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435350713] [2022-04-28 09:15:45,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:45,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {11095#(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(14, 2);call #Ultimate.allocInit(12, 3); {11069#true} is VALID [2022-04-28 09:15:45,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {11069#true} assume true; {11069#true} is VALID [2022-04-28 09:15:45,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11069#true} {11069#true} #42#return; {11069#true} is VALID [2022-04-28 09:15:45,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {11069#true} call ULTIMATE.init(); {11095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:45,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {11095#(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(14, 2);call #Ultimate.allocInit(12, 3); {11069#true} is VALID [2022-04-28 09:15:45,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {11069#true} assume true; {11069#true} is VALID [2022-04-28 09:15:45,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11069#true} {11069#true} #42#return; {11069#true} is VALID [2022-04-28 09:15:45,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {11069#true} call #t~ret6 := main(); {11069#true} is VALID [2022-04-28 09:15:45,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {11069#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {11074#(= main_~x~0 0)} is VALID [2022-04-28 09:15:45,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {11074#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {11074#(= main_~x~0 0)} is VALID [2022-04-28 09:15:45,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {11074#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:45,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {11075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {11075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:45,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {11075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11076#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:45,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {11076#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11076#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:45,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {11076#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11077#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:45,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {11077#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {11077#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:45,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {11077#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11078#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:45,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {11078#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11078#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:45,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {11078#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11079#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:45,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {11079#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11079#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:45,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {11079#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11080#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:45,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {11080#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11080#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:45,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {11080#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11081#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:45,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {11081#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {11081#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:45,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {11081#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11082#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:45,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {11082#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11082#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:45,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {11082#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11083#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:45,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {11083#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11083#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:45,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {11083#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11084#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:45,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {11084#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11084#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:45,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {11084#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11085#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:45,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {11085#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {11085#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:45,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {11085#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11086#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:45,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {11086#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11086#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:45,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {11086#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11087#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:45,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {11087#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11087#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:45,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {11087#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11088#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:45,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {11088#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {11088#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:45,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {11088#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11089#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:45,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {11089#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {11089#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:45,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {11089#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11090#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:45,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {11090#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11090#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:45,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {11090#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11091#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:15:45,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {11091#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11091#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:15:45,575 INFO L290 TraceCheckUtils]: 41: Hoare triple {11091#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11092#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:15:45,575 INFO L290 TraceCheckUtils]: 42: Hoare triple {11092#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11092#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:15:45,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {11092#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11093#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:15:45,576 INFO L290 TraceCheckUtils]: 44: Hoare triple {11093#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11093#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:15:45,576 INFO L290 TraceCheckUtils]: 45: Hoare triple {11093#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11094#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-28 09:15:45,577 INFO L290 TraceCheckUtils]: 46: Hoare triple {11094#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} assume !(~x~0 % 4294967296 < 99); {11070#false} is VALID [2022-04-28 09:15:45,577 INFO L272 TraceCheckUtils]: 47: Hoare triple {11070#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11070#false} is VALID [2022-04-28 09:15:45,577 INFO L290 TraceCheckUtils]: 48: Hoare triple {11070#false} ~cond := #in~cond; {11070#false} is VALID [2022-04-28 09:15:45,577 INFO L290 TraceCheckUtils]: 49: Hoare triple {11070#false} assume 0 == ~cond; {11070#false} is VALID [2022-04-28 09:15:45,577 INFO L290 TraceCheckUtils]: 50: Hoare triple {11070#false} assume !false; {11070#false} is VALID [2022-04-28 09:15:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:45,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435350713] [2022-04-28 09:15:45,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435350713] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:45,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185422961] [2022-04-28 09:15:45,578 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:15:45,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:45,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:45,580 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 09:15:45,580 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 09:15:45,619 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:15:45,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:45,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 09:15:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:45,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:46,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {11069#true} call ULTIMATE.init(); {11069#true} is VALID [2022-04-28 09:15:46,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {11069#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(14, 2);call #Ultimate.allocInit(12, 3); {11069#true} is VALID [2022-04-28 09:15:46,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {11069#true} assume true; {11069#true} is VALID [2022-04-28 09:15:46,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11069#true} {11069#true} #42#return; {11069#true} is VALID [2022-04-28 09:15:46,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {11069#true} call #t~ret6 := main(); {11069#true} is VALID [2022-04-28 09:15:46,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {11069#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {11074#(= main_~x~0 0)} is VALID [2022-04-28 09:15:46,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {11074#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {11074#(= main_~x~0 0)} is VALID [2022-04-28 09:15:46,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {11074#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11120#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:15:46,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {11120#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {11120#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:15:46,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {11120#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11127#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:46,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {11127#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {11127#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:46,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {11127#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11134#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:15:46,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {11134#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {11134#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:15:46,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {11134#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11141#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:15:46,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {11141#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {11141#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:15:46,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {11141#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11148#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {11148#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {11148#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {11148#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11155#(and (= (+ main_~x~0 (- 4)) 8) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {11155#(and (= (+ main_~x~0 (- 4)) 8) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {11155#(and (= (+ main_~x~0 (- 4)) 8) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {11155#(and (= (+ main_~x~0 (- 4)) 8) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11162#(and (<= (mod main_~y~0 2) 0) (= 8 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:15:46,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {11162#(and (<= (mod main_~y~0 2) 0) (= 8 (+ main_~x~0 (- 6))))} assume !!(~x~0 % 4294967296 < 99); {11162#(and (<= (mod main_~y~0 2) 0) (= 8 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:15:46,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {11162#(and (<= (mod main_~y~0 2) 0) (= 8 (+ main_~x~0 (- 6))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11169#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-28 09:15:46,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {11169#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume !!(~x~0 % 4294967296 < 99); {11169#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-28 09:15:46,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {11169#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11176#(and (<= (mod main_~y~0 2) 0) (= 16 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:46,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {11176#(and (<= (mod main_~y~0 2) 0) (= 16 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {11176#(and (<= (mod main_~y~0 2) 0) (= 16 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:46,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {11176#(and (<= (mod main_~y~0 2) 0) (= 16 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11183#(and (= 16 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {11183#(and (= 16 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {11183#(and (= 16 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {11183#(and (= 16 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11190#(and (= 16 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {11190#(and (= 16 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {11190#(and (= 16 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {11190#(and (= 16 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11197#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {11197#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {11197#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {11197#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11204#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:15:46,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {11204#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 99); {11204#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:15:46,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {11204#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11211#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {11211#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {11211#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {11211#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11218#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:15:46,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {11218#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11218#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:15:46,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {11218#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11225#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:46,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {11225#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {11225#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:46,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {11225#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11232#(and (<= (mod main_~y~0 2) 0) (= 30 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:15:46,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {11232#(and (<= (mod main_~y~0 2) 0) (= 30 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < 99); {11232#(and (<= (mod main_~y~0 2) 0) (= 30 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:15:46,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {11232#(and (<= (mod main_~y~0 2) 0) (= 30 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11239#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:15:46,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {11239#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume !!(~x~0 % 4294967296 < 99); {11239#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:15:46,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {11239#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11246#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {11246#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {11246#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {11246#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11253#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {11253#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {11253#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:46,240 INFO L272 TraceCheckUtils]: 47: Hoare triple {11253#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11260#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:46,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {11260#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11264#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:46,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {11264#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11070#false} is VALID [2022-04-28 09:15:46,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {11070#false} assume !false; {11070#false} is VALID [2022-04-28 09:15:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:46,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:46,511 INFO L290 TraceCheckUtils]: 50: Hoare triple {11070#false} assume !false; {11070#false} is VALID [2022-04-28 09:15:46,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {11264#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11070#false} is VALID [2022-04-28 09:15:46,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {11260#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11264#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:46,512 INFO L272 TraceCheckUtils]: 47: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11260#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:46,512 INFO L290 TraceCheckUtils]: 46: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,513 INFO L290 TraceCheckUtils]: 45: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {11401#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:46,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {11401#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {11401#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:46,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {11069#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {11401#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:46,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {11069#true} call #t~ret6 := main(); {11069#true} is VALID [2022-04-28 09:15:46,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11069#true} {11069#true} #42#return; {11069#true} is VALID [2022-04-28 09:15:46,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {11069#true} assume true; {11069#true} is VALID [2022-04-28 09:15:46,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {11069#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(14, 2);call #Ultimate.allocInit(12, 3); {11069#true} is VALID [2022-04-28 09:15:46,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {11069#true} call ULTIMATE.init(); {11069#true} is VALID [2022-04-28 09:15:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-04-28 09:15:46,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185422961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:46,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:46,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 6] total 48 [2022-04-28 09:15:46,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:46,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1305355429] [2022-04-28 09:15:46,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1305355429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:46,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:46,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 09:15:46,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859400366] [2022-04-28 09:15:46,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:46,528 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 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 09:15:46,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:46,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 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 09:15:46,550 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 09:15:46,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 09:15:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:46,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 09:15:46,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2044, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 09:15:46,553 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 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 09:15:47,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:47,619 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 09:15:47,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 09:15:47,619 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 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 09:15:47,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 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 09:15:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 60 transitions. [2022-04-28 09:15:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 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 09:15:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 60 transitions. [2022-04-28 09:15:47,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 60 transitions. [2022-04-28 09:15:47,653 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 09:15:47,653 INFO L225 Difference]: With dead ends: 60 [2022-04-28 09:15:47,653 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 09:15:47,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=356, Invalid=4336, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 09:15:47,655 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:47,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 48 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:15:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 09:15:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-28 09:15:47,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:47,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 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 09:15:47,752 INFO L74 IsIncluded]: Start isIncluded. First operand 55 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 09:15:47,752 INFO L87 Difference]: Start difference. First operand 55 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 09:15:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:47,761 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 09:15:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 09:15:47,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:47,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:47,761 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 55 states. [2022-04-28 09:15:47,761 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 55 states. [2022-04-28 09:15:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:47,767 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 09:15:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 09:15:47,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:47,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:47,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:47,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:47,767 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 09:15:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-28 09:15:47,771 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2022-04-28 09:15:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:47,772 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-28 09:15:47,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 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 09:15:47,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 54 transitions. [2022-04-28 09:15:47,822 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 09:15:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 09:15:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 09:15:47,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:47,823 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:47,857 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 09:15:48,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:48,024 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:48,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1562880343, now seen corresponding path program 41 times [2022-04-28 09:15:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:48,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [240696925] [2022-04-28 09:15:48,026 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:48,026 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1562880343, now seen corresponding path program 42 times [2022-04-28 09:15:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:48,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825786353] [2022-04-28 09:15:48,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:48,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:48,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {11832#(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(14, 2);call #Ultimate.allocInit(12, 3); {11805#true} is VALID [2022-04-28 09:15:48,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {11805#true} assume true; {11805#true} is VALID [2022-04-28 09:15:48,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11805#true} {11805#true} #42#return; {11805#true} is VALID [2022-04-28 09:15:48,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {11805#true} call ULTIMATE.init(); {11832#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:48,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {11832#(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(14, 2);call #Ultimate.allocInit(12, 3); {11805#true} is VALID [2022-04-28 09:15:48,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {11805#true} assume true; {11805#true} is VALID [2022-04-28 09:15:48,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11805#true} {11805#true} #42#return; {11805#true} is VALID [2022-04-28 09:15:48,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {11805#true} call #t~ret6 := main(); {11805#true} is VALID [2022-04-28 09:15:48,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {11805#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {11810#(= main_~x~0 0)} is VALID [2022-04-28 09:15:48,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {11810#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {11810#(= main_~x~0 0)} is VALID [2022-04-28 09:15:48,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {11810#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11811#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:48,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {11811#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {11811#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:48,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {11811#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:48,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {11812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:48,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {11812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11813#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:48,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {11813#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {11813#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:48,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {11813#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:48,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {11814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:48,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {11814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11815#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:48,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {11815#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11815#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:48,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {11815#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11816#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:48,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {11816#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11816#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:48,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {11816#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11817#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:48,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {11817#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {11817#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:48,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {11817#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:48,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {11818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:48,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {11818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11819#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:48,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {11819#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11819#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:48,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {11819#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11820#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:48,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {11820#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11820#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:48,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {11820#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11821#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:48,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {11821#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {11821#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:48,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {11821#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11822#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:48,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {11822#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11822#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:48,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {11822#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11823#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:48,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {11823#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11823#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:48,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {11823#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11824#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:48,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {11824#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {11824#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:48,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {11824#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11825#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:48,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {11825#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {11825#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:48,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {11825#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11826#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:48,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {11826#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11826#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:48,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {11826#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11827#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:15:48,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {11827#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11827#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:15:48,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {11827#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11828#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:15:48,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {11828#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11828#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:15:48,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {11828#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11829#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:15:48,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {11829#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11829#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:15:48,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {11829#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11830#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:15:48,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {11830#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11830#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:15:48,404 INFO L290 TraceCheckUtils]: 47: Hoare triple {11830#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11831#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:15:48,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {11831#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {11806#false} is VALID [2022-04-28 09:15:48,405 INFO L272 TraceCheckUtils]: 49: Hoare triple {11806#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11806#false} is VALID [2022-04-28 09:15:48,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {11806#false} ~cond := #in~cond; {11806#false} is VALID [2022-04-28 09:15:48,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {11806#false} assume 0 == ~cond; {11806#false} is VALID [2022-04-28 09:15:48,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {11806#false} assume !false; {11806#false} is VALID [2022-04-28 09:15:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:48,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:48,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825786353] [2022-04-28 09:15:48,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825786353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:48,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015589258] [2022-04-28 09:15:48,406 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:15:48,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:48,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:48,407 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 09:15:48,408 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 09:15:48,682 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-28 09:15:48,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:48,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 09:15:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:48,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:49,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {11805#true} call ULTIMATE.init(); {11805#true} is VALID [2022-04-28 09:15:49,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {11805#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(14, 2);call #Ultimate.allocInit(12, 3); {11805#true} is VALID [2022-04-28 09:15:49,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {11805#true} assume true; {11805#true} is VALID [2022-04-28 09:15:49,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11805#true} {11805#true} #42#return; {11805#true} is VALID [2022-04-28 09:15:49,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {11805#true} call #t~ret6 := main(); {11805#true} is VALID [2022-04-28 09:15:49,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {11805#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {11810#(= main_~x~0 0)} is VALID [2022-04-28 09:15:49,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {11810#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {11810#(= main_~x~0 0)} is VALID [2022-04-28 09:15:49,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {11810#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11811#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:49,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {11811#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {11811#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:49,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {11811#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:49,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {11812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:49,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {11812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11813#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:49,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {11813#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {11813#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:49,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {11813#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:49,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {11814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:49,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {11814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11815#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:49,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {11815#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11815#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:49,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {11815#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11816#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:49,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {11816#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11816#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:49,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {11816#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11817#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:49,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {11817#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {11817#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:49,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {11817#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:49,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {11818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:49,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {11818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11819#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:49,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {11819#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11819#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:49,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {11819#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11820#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:49,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {11820#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11820#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:49,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {11820#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11917#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:49,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {11917#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {11917#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:49,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {11917#(and (<= (mod main_~y~0 2) 0) (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11924#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:49,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {11924#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {11924#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:49,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {11924#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11931#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:49,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {11931#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11931#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:49,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {11931#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11938#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:49,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {11938#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {11938#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:49,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {11938#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11945#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:49,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {11945#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {11945#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:49,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {11945#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11952#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:49,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {11952#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11952#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:49,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {11952#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11959#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:49,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {11959#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {11959#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:49,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {11959#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11966#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:49,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {11966#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {11966#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:49,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {11966#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11973#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} is VALID [2022-04-28 09:15:49,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {11973#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11973#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} is VALID [2022-04-28 09:15:49,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {11973#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11980#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:15:49,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {11980#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11980#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:15:49,375 INFO L290 TraceCheckUtils]: 47: Hoare triple {11980#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {11987#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:49,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {11987#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {11806#false} is VALID [2022-04-28 09:15:49,376 INFO L272 TraceCheckUtils]: 49: Hoare triple {11806#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11806#false} is VALID [2022-04-28 09:15:49,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {11806#false} ~cond := #in~cond; {11806#false} is VALID [2022-04-28 09:15:49,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {11806#false} assume 0 == ~cond; {11806#false} is VALID [2022-04-28 09:15:49,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {11806#false} assume !false; {11806#false} is VALID [2022-04-28 09:15:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:49,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:50,920 INFO L290 TraceCheckUtils]: 52: Hoare triple {11806#false} assume !false; {11806#false} is VALID [2022-04-28 09:15:50,920 INFO L290 TraceCheckUtils]: 51: Hoare triple {12006#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11806#false} is VALID [2022-04-28 09:15:50,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {12010#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12006#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:15:50,921 INFO L272 TraceCheckUtils]: 49: Hoare triple {12014#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12010#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:50,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {12018#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !(~x~0 % 4294967296 < 99); {12014#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:50,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {12022#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12018#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:15:50,923 INFO L290 TraceCheckUtils]: 46: Hoare triple {12022#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {12022#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-28 09:15:50,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {12029#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12022#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-28 09:15:50,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {12029#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {12029#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:15:50,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {12036#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12029#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:15:50,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {12036#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {12036#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:15:50,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {12043#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12036#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:15:50,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {12043#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {12043#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:15:50,927 INFO L290 TraceCheckUtils]: 39: Hoare triple {12050#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12043#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:15:50,927 INFO L290 TraceCheckUtils]: 38: Hoare triple {12050#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {12050#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-28 09:15:50,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {12057#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12050#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-28 09:15:50,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {12057#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {12057#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-28 09:15:50,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {12064#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12057#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-28 09:15:50,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {12064#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {12064#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-28 09:15:50,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {12071#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12064#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-28 09:15:50,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {12071#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {12071#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:15:50,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {12078#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12071#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:15:50,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {12078#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {12078#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-28 09:15:50,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {12085#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12078#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-28 09:15:50,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {12085#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {12085#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:15:50,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {12092#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12085#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:15:50,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {12092#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12092#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {12099#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12092#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {12099#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12099#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {12106#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12099#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {12106#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12106#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {12113#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 28) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12106#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {12113#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 28) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {12113#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-28 09:15:50,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {12120#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12113#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-28 09:15:50,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {12120#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12120#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {12127#(or (< (mod (+ 32 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12120#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {12127#(or (< (mod (+ 32 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12127#(or (< (mod (+ 32 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {12134#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12127#(or (< (mod (+ 32 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {12134#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12134#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {12141#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12134#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {12141#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12141#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {12148#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12141#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {12148#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12148#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {12155#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12148#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {12155#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12155#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {12162#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 42 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12155#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:15:50,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {12162#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 42 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {12162#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 42 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:15:50,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {11805#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {12162#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 42 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:15:50,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {11805#true} call #t~ret6 := main(); {11805#true} is VALID [2022-04-28 09:15:50,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11805#true} {11805#true} #42#return; {11805#true} is VALID [2022-04-28 09:15:50,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {11805#true} assume true; {11805#true} is VALID [2022-04-28 09:15:50,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {11805#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(14, 2);call #Ultimate.allocInit(12, 3); {11805#true} is VALID [2022-04-28 09:15:50,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {11805#true} call ULTIMATE.init(); {11805#true} is VALID [2022-04-28 09:15:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:50,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015589258] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:50,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:50,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 27] total 61 [2022-04-28 09:15:50,950 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:50,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [240696925] [2022-04-28 09:15:50,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [240696925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:50,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:50,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 09:15:50,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086449851] [2022-04-28 09:15:50,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:50,951 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 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 09:15:50,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:50,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 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 09:15:50,976 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 09:15:50,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 09:15:50,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:50,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 09:15:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=909, Invalid=2751, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 09:15:50,978 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 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 09:15:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:52,217 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 09:15:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 09:15:52,217 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 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 09:15:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 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 09:15:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 62 transitions. [2022-04-28 09:15:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 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 09:15:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 62 transitions. [2022-04-28 09:15:52,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 62 transitions. [2022-04-28 09:15:52,292 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 09:15:52,293 INFO L225 Difference]: With dead ends: 62 [2022-04-28 09:15:52,293 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 09:15:52,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1523, Invalid=5283, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 09:15:52,297 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:52,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 113 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 09:15:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 09:15:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-28 09:15:52,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:52,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 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 09:15:52,420 INFO L74 IsIncluded]: Start isIncluded. First operand 57 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 09:15:52,421 INFO L87 Difference]: Start difference. First operand 57 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 09:15:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:52,421 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 09:15:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 09:15:52,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:52,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:52,422 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 57 states. [2022-04-28 09:15:52,422 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 57 states. [2022-04-28 09:15:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:52,423 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 09:15:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 09:15:52,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:52,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:52,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:52,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:52,423 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 09:15:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-28 09:15:52,424 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2022-04-28 09:15:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:52,424 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-28 09:15:52,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 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 09:15:52,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2022-04-28 09:15:52,489 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 09:15:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 09:15:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 09:15:52,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:52,490 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:52,505 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 09:15:52,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:52,694 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:52,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:52,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1942457114, now seen corresponding path program 43 times [2022-04-28 09:15:52,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:52,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1347262774] [2022-04-28 09:15:52,697 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:52,697 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1942457114, now seen corresponding path program 44 times [2022-04-28 09:15:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:52,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364226578] [2022-04-28 09:15:52,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:52,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:53,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:53,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {12608#(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(14, 2);call #Ultimate.allocInit(12, 3); {12580#true} is VALID [2022-04-28 09:15:53,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {12580#true} assume true; {12580#true} is VALID [2022-04-28 09:15:53,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12580#true} {12580#true} #42#return; {12580#true} is VALID [2022-04-28 09:15:53,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {12580#true} call ULTIMATE.init(); {12608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:53,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {12608#(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(14, 2);call #Ultimate.allocInit(12, 3); {12580#true} is VALID [2022-04-28 09:15:53,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {12580#true} assume true; {12580#true} is VALID [2022-04-28 09:15:53,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12580#true} {12580#true} #42#return; {12580#true} is VALID [2022-04-28 09:15:53,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {12580#true} call #t~ret6 := main(); {12580#true} is VALID [2022-04-28 09:15:53,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {12580#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {12585#(= main_~x~0 0)} is VALID [2022-04-28 09:15:53,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {12585#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {12585#(= main_~x~0 0)} is VALID [2022-04-28 09:15:53,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {12585#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:53,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {12586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {12586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:53,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {12586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:53,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {12587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:53,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {12587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:53,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {12588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {12588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:53,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {12588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:53,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {12589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:53,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {12589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:53,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {12590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:53,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {12590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:53,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {12591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:53,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {12591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:53,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {12592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {12592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:53,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {12592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:53,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {12593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:53,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {12593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:53,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {12594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:53,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {12594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:53,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {12595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:53,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {12595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:53,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {12596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {12596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:53,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {12596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:53,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {12597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:53,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {12597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:53,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {12598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:53,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {12598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:53,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {12599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {12599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:53,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {12599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:53,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {12600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {12600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:53,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {12600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:53,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {12601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:53,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {12601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:15:53,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {12602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:15:53,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {12602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:15:53,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {12603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:15:53,129 INFO L290 TraceCheckUtils]: 43: Hoare triple {12603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:15:53,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {12604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:15:53,130 INFO L290 TraceCheckUtils]: 45: Hoare triple {12604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:15:53,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {12605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:15:53,131 INFO L290 TraceCheckUtils]: 47: Hoare triple {12605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:15:53,131 INFO L290 TraceCheckUtils]: 48: Hoare triple {12606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:15:53,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {12606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12607#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 44))} is VALID [2022-04-28 09:15:53,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {12607#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 < 99); {12581#false} is VALID [2022-04-28 09:15:53,132 INFO L272 TraceCheckUtils]: 51: Hoare triple {12581#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12581#false} is VALID [2022-04-28 09:15:53,133 INFO L290 TraceCheckUtils]: 52: Hoare triple {12581#false} ~cond := #in~cond; {12581#false} is VALID [2022-04-28 09:15:53,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {12581#false} assume 0 == ~cond; {12581#false} is VALID [2022-04-28 09:15:53,133 INFO L290 TraceCheckUtils]: 54: Hoare triple {12581#false} assume !false; {12581#false} is VALID [2022-04-28 09:15:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:53,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:53,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364226578] [2022-04-28 09:15:53,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364226578] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:53,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462636921] [2022-04-28 09:15:53,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:15:53,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:53,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:53,135 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 09:15:53,136 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 09:15:53,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:15:53,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:53,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-28 09:15:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:53,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:54,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {12580#true} call ULTIMATE.init(); {12580#true} is VALID [2022-04-28 09:15:54,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {12580#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(14, 2);call #Ultimate.allocInit(12, 3); {12580#true} is VALID [2022-04-28 09:15:54,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {12580#true} assume true; {12580#true} is VALID [2022-04-28 09:15:54,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12580#true} {12580#true} #42#return; {12580#true} is VALID [2022-04-28 09:15:54,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {12580#true} call #t~ret6 := main(); {12580#true} is VALID [2022-04-28 09:15:54,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {12580#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {12585#(= main_~x~0 0)} is VALID [2022-04-28 09:15:54,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {12585#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {12585#(= main_~x~0 0)} is VALID [2022-04-28 09:15:54,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {12585#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12633#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {12633#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12633#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {12633#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12640#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:15:54,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {12640#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume !!(~x~0 % 4294967296 < 99); {12640#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:15:54,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {12640#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12647#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {12647#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12647#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {12647#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12654#(and (= (+ main_~x~0 (- 8)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {12654#(and (= (+ main_~x~0 (- 8)) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12654#(and (= (+ main_~x~0 (- 8)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {12654#(and (= (+ main_~x~0 (- 8)) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12661#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {12661#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12661#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {12661#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12668#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {12668#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12668#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {12668#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12675#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {12675#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12675#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {12675#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12682#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {12682#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12682#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {12682#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12689#(and (= 14 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {12689#(and (= 14 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12689#(and (= 14 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {12689#(and (= 14 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12696#(and (<= (mod main_~y~0 2) 0) (= 14 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:15:54,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {12696#(and (<= (mod main_~y~0 2) 0) (= 14 (+ main_~x~0 (- 6))))} assume !!(~x~0 % 4294967296 < 99); {12696#(and (<= (mod main_~y~0 2) 0) (= 14 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:15:54,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {12696#(and (<= (mod main_~y~0 2) 0) (= 14 (+ main_~x~0 (- 6))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12703#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {12703#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12703#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {12703#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12710#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {12710#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12710#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {12710#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12717#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:15:54,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {12717#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 99); {12717#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:15:54,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {12717#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12724#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {12724#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12724#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {12724#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12731#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:15:54,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {12731#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12731#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:15:54,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {12731#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12738#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {12738#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12738#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {12738#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12745#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:15:54,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {12745#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {12745#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:15:54,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {12745#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12752#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:15:54,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {12752#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume !!(~x~0 % 4294967296 < 99); {12752#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:15:54,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {12752#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12759#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {12759#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12759#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {12759#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12766#(and (<= (mod main_~y~0 2) 0) (= 38 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:54,167 INFO L290 TraceCheckUtils]: 46: Hoare triple {12766#(and (<= (mod main_~y~0 2) 0) (= 38 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {12766#(and (<= (mod main_~y~0 2) 0) (= 38 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:15:54,167 INFO L290 TraceCheckUtils]: 47: Hoare triple {12766#(and (<= (mod main_~y~0 2) 0) (= 38 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12773#(and (= (+ main_~x~0 (- 4)) 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,168 INFO L290 TraceCheckUtils]: 48: Hoare triple {12773#(and (= (+ main_~x~0 (- 4)) 38) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {12773#(and (= (+ main_~x~0 (- 4)) 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {12773#(and (= (+ main_~x~0 (- 4)) 38) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12780#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {12780#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {12780#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:54,169 INFO L272 TraceCheckUtils]: 51: Hoare triple {12780#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12787#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:54,170 INFO L290 TraceCheckUtils]: 52: Hoare triple {12787#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12791#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:54,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {12791#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12581#false} is VALID [2022-04-28 09:15:54,170 INFO L290 TraceCheckUtils]: 54: Hoare triple {12581#false} assume !false; {12581#false} is VALID [2022-04-28 09:15:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:54,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:54,574 INFO L290 TraceCheckUtils]: 54: Hoare triple {12581#false} assume !false; {12581#false} is VALID [2022-04-28 09:15:54,575 INFO L290 TraceCheckUtils]: 53: Hoare triple {12791#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12581#false} is VALID [2022-04-28 09:15:54,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {12787#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12791#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:54,576 INFO L272 TraceCheckUtils]: 51: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12787#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:54,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,577 INFO L290 TraceCheckUtils]: 48: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,577 INFO L290 TraceCheckUtils]: 47: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,577 INFO L290 TraceCheckUtils]: 46: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,580 INFO L290 TraceCheckUtils]: 40: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,580 INFO L290 TraceCheckUtils]: 39: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {12940#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {12807#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:54,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {12940#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {12940#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:54,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {12580#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {12940#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:54,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {12580#true} call #t~ret6 := main(); {12580#true} is VALID [2022-04-28 09:15:54,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12580#true} {12580#true} #42#return; {12580#true} is VALID [2022-04-28 09:15:54,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {12580#true} assume true; {12580#true} is VALID [2022-04-28 09:15:54,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {12580#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(14, 2);call #Ultimate.allocInit(12, 3); {12580#true} is VALID [2022-04-28 09:15:54,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {12580#true} call ULTIMATE.init(); {12580#true} is VALID [2022-04-28 09:15:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-04-28 09:15:54,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462636921] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:54,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:54,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 6] total 52 [2022-04-28 09:15:54,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:54,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1347262774] [2022-04-28 09:15:54,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1347262774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:54,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:54,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 09:15:54,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634360638] [2022-04-28 09:15:54,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:54,596 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 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 09:15:54,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:54,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 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 09:15:54,637 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 09:15:54,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 09:15:54,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:54,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 09:15:54,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2420, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 09:15:54,638 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 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 09:15:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:55,957 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 09:15:55,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 09:15:55,958 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 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 09:15:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 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 09:15:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 64 transitions. [2022-04-28 09:15:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 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 09:15:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 64 transitions. [2022-04-28 09:15:55,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 64 transitions. [2022-04-28 09:15:55,999 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 09:15:55,999 INFO L225 Difference]: With dead ends: 64 [2022-04-28 09:15:55,999 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 09:15:56,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=390, Invalid=5160, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 09:15:56,001 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:56,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 38 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 09:15:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 09:15:56,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-28 09:15:56,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:56,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 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 09:15:56,169 INFO L74 IsIncluded]: Start isIncluded. First operand 59 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 09:15:56,169 INFO L87 Difference]: Start difference. First operand 59 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 09:15:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:56,170 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 09:15:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 09:15:56,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:56,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:56,170 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 59 states. [2022-04-28 09:15:56,170 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 59 states. [2022-04-28 09:15:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:56,193 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 09:15:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 09:15:56,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:56,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:56,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:56,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:56,194 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 09:15:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-28 09:15:56,194 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2022-04-28 09:15:56,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:56,195 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-28 09:15:56,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 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 09:15:56,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 58 transitions. [2022-04-28 09:15:56,264 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 09:15:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 09:15:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 09:15:56,264 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:56,264 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:15:56,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-28 09:15:56,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:56,465 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:56,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:56,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1643513885, now seen corresponding path program 45 times [2022-04-28 09:15:56,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:56,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2090038791] [2022-04-28 09:15:56,468 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:15:56,468 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:56,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1643513885, now seen corresponding path program 46 times [2022-04-28 09:15:56,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:56,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877720410] [2022-04-28 09:15:56,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:56,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:56,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:56,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {13401#(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(14, 2);call #Ultimate.allocInit(12, 3); {13372#true} is VALID [2022-04-28 09:15:56,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {13372#true} assume true; {13372#true} is VALID [2022-04-28 09:15:56,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13372#true} {13372#true} #42#return; {13372#true} is VALID [2022-04-28 09:15:56,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {13372#true} call ULTIMATE.init(); {13401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:56,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {13401#(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(14, 2);call #Ultimate.allocInit(12, 3); {13372#true} is VALID [2022-04-28 09:15:56,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {13372#true} assume true; {13372#true} is VALID [2022-04-28 09:15:56,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13372#true} {13372#true} #42#return; {13372#true} is VALID [2022-04-28 09:15:56,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {13372#true} call #t~ret6 := main(); {13372#true} is VALID [2022-04-28 09:15:56,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {13372#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {13377#(= main_~x~0 0)} is VALID [2022-04-28 09:15:56,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {13377#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {13377#(= main_~x~0 0)} is VALID [2022-04-28 09:15:56,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {13377#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13378#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:56,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {13378#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {13378#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:15:56,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {13378#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13379#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:56,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {13379#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13379#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:15:56,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {13379#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13380#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:56,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {13380#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {13380#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:15:56,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {13380#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13381#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:56,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {13381#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13381#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:15:56,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {13381#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13382#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:56,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {13382#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13382#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:15:56,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {13382#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13383#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:56,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {13383#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13383#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:15:56,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {13383#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13384#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:56,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {13384#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {13384#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:15:56,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {13384#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13385#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:56,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {13385#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13385#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:15:56,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {13385#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13386#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:56,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {13386#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13386#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:15:56,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {13386#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13387#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:56,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {13387#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13387#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:15:56,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {13387#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13388#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:56,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {13388#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {13388#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:15:56,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {13388#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13389#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:56,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {13389#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13389#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:15:56,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {13389#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13390#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:56,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {13390#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13390#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:15:56,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {13390#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13391#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:56,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {13391#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {13391#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:15:56,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {13391#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13392#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:56,877 INFO L290 TraceCheckUtils]: 36: Hoare triple {13392#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {13392#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:15:56,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {13392#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13393#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:56,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {13393#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13393#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:15:56,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {13393#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13394#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:15:56,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {13394#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13394#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:15:56,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {13394#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13395#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:15:56,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {13395#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13395#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:15:56,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {13395#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13396#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:15:56,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {13396#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13396#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:15:56,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {13396#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13397#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:15:56,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {13397#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13397#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:15:56,880 INFO L290 TraceCheckUtils]: 47: Hoare triple {13397#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13398#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:15:56,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {13398#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13398#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:15:56,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {13398#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13399#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:15:56,881 INFO L290 TraceCheckUtils]: 50: Hoare triple {13399#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {13399#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:15:56,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {13399#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13400#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 46))} is VALID [2022-04-28 09:15:56,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {13400#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 46))} assume !(~x~0 % 4294967296 < 99); {13373#false} is VALID [2022-04-28 09:15:56,882 INFO L272 TraceCheckUtils]: 53: Hoare triple {13373#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13373#false} is VALID [2022-04-28 09:15:56,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {13373#false} ~cond := #in~cond; {13373#false} is VALID [2022-04-28 09:15:56,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {13373#false} assume 0 == ~cond; {13373#false} is VALID [2022-04-28 09:15:56,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {13373#false} assume !false; {13373#false} is VALID [2022-04-28 09:15:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:56,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:56,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877720410] [2022-04-28 09:15:56,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877720410] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:56,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570394925] [2022-04-28 09:15:56,883 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:15:56,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:56,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:56,884 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 09:15:56,885 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 09:15:56,913 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:15:56,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:56,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 09:15:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:56,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:57,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {13372#true} call ULTIMATE.init(); {13372#true} is VALID [2022-04-28 09:15:57,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {13372#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(14, 2);call #Ultimate.allocInit(12, 3); {13372#true} is VALID [2022-04-28 09:15:57,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {13372#true} assume true; {13372#true} is VALID [2022-04-28 09:15:57,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13372#true} {13372#true} #42#return; {13372#true} is VALID [2022-04-28 09:15:57,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {13372#true} call #t~ret6 := main(); {13372#true} is VALID [2022-04-28 09:15:57,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {13372#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {13377#(= main_~x~0 0)} is VALID [2022-04-28 09:15:57,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {13377#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {13377#(= main_~x~0 0)} is VALID [2022-04-28 09:15:57,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {13377#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13426#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {13426#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13426#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {13426#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13433#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:15:57,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {13433#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume !!(~x~0 % 4294967296 < 99); {13433#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:15:57,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {13433#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13440#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {13440#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13440#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {13440#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13447#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:15:57,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {13447#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {13447#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:15:57,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {13447#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13454#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {13454#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13454#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {13454#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13461#(and (= (+ main_~x~0 (- 4)) 8) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {13461#(and (= (+ main_~x~0 (- 4)) 8) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13461#(and (= (+ main_~x~0 (- 4)) 8) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {13461#(and (= (+ main_~x~0 (- 4)) 8) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13468#(and (<= (mod main_~y~0 2) 0) (= 8 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:15:57,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {13468#(and (<= (mod main_~y~0 2) 0) (= 8 (+ main_~x~0 (- 6))))} assume !!(~x~0 % 4294967296 < 99); {13468#(and (<= (mod main_~y~0 2) 0) (= 8 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:15:57,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {13468#(and (<= (mod main_~y~0 2) 0) (= 8 (+ main_~x~0 (- 6))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13475#(and (= (+ main_~x~0 (- 8)) 8) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {13475#(and (= (+ main_~x~0 (- 8)) 8) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13475#(and (= (+ main_~x~0 (- 8)) 8) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {13475#(and (= (+ main_~x~0 (- 8)) 8) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13482#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {13482#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13482#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {13482#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13489#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {13489#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13489#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {13489#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13496#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {13496#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13496#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {13496#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13503#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {13503#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13503#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {13503#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13510#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:15:57,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {13510#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 99); {13510#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:15:57,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {13510#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13517#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {13517#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13517#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {13517#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13524#(and (= 28 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {13524#(and (= 28 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13524#(and (= 28 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {13524#(and (= 28 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13531#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {13531#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13531#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {13531#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13538#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {13538#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13538#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {13538#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13545#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:15:57,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {13545#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume !!(~x~0 % 4294967296 < 99); {13545#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:15:57,870 INFO L290 TraceCheckUtils]: 43: Hoare triple {13545#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13552#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {13552#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13552#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {13552#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13559#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {13559#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13559#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {13559#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13566#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:15:57,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {13566#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13566#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:15:57,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {13566#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13573#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {13573#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {13573#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:15:57,876 INFO L290 TraceCheckUtils]: 51: Hoare triple {13573#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13580#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:15:57,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {13580#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume !(~x~0 % 4294967296 < 99); {13580#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:15:57,877 INFO L272 TraceCheckUtils]: 53: Hoare triple {13580#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:57,877 INFO L290 TraceCheckUtils]: 54: Hoare triple {13587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:57,877 INFO L290 TraceCheckUtils]: 55: Hoare triple {13591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13373#false} is VALID [2022-04-28 09:15:57,877 INFO L290 TraceCheckUtils]: 56: Hoare triple {13373#false} assume !false; {13373#false} is VALID [2022-04-28 09:15:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:15:57,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:58,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {13373#false} assume !false; {13373#false} is VALID [2022-04-28 09:15:58,297 INFO L290 TraceCheckUtils]: 55: Hoare triple {13591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13373#false} is VALID [2022-04-28 09:15:58,298 INFO L290 TraceCheckUtils]: 54: Hoare triple {13587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:15:58,298 INFO L272 TraceCheckUtils]: 53: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:15:58,299 INFO L290 TraceCheckUtils]: 52: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,299 INFO L290 TraceCheckUtils]: 51: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,299 INFO L290 TraceCheckUtils]: 50: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,301 INFO L290 TraceCheckUtils]: 46: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {13746#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {13607#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:15:58,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {13746#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {13746#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:58,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {13372#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {13746#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:15:58,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {13372#true} call #t~ret6 := main(); {13372#true} is VALID [2022-04-28 09:15:58,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13372#true} {13372#true} #42#return; {13372#true} is VALID [2022-04-28 09:15:58,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {13372#true} assume true; {13372#true} is VALID [2022-04-28 09:15:58,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {13372#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(14, 2);call #Ultimate.allocInit(12, 3); {13372#true} is VALID [2022-04-28 09:15:58,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {13372#true} call ULTIMATE.init(); {13372#true} is VALID [2022-04-28 09:15:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-28 09:15:58,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570394925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:58,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:58,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 6] total 54 [2022-04-28 09:15:58,318 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:58,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2090038791] [2022-04-28 09:15:58,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2090038791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:58,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:58,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 09:15:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717998061] [2022-04-28 09:15:58,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:58,319 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 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 09:15:58,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:58,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 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 09:15:58,358 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 09:15:58,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 09:15:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:58,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 09:15:58,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2620, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 09:15:58,359 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 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 09:16:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:00,421 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 09:16:00,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 09:16:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 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 09:16:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 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 09:16:00,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 66 transitions. [2022-04-28 09:16:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 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 09:16:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 66 transitions. [2022-04-28 09:16:00,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 66 transitions. [2022-04-28 09:16:00,472 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 09:16:00,473 INFO L225 Difference]: With dead ends: 66 [2022-04-28 09:16:00,473 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 09:16:00,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=407, Invalid=5599, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 09:16:00,474 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 55 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:00,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 63 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 09:16:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 09:16:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-28 09:16:00,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:00,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 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 09:16:00,656 INFO L74 IsIncluded]: Start isIncluded. First operand 61 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 09:16:00,656 INFO L87 Difference]: Start difference. First operand 61 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 09:16:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:00,657 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 09:16:00,657 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 09:16:00,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:00,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:00,658 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 61 states. [2022-04-28 09:16:00,658 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 61 states. [2022-04-28 09:16:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:00,658 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 09:16:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 09:16:00,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:00,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:00,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:00,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:00,659 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 09:16:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2022-04-28 09:16:00,659 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2022-04-28 09:16:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:00,660 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2022-04-28 09:16:00,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 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 09:16:00,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 60 transitions. [2022-04-28 09:16:00,731 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 09:16:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 09:16:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 09:16:00,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:00,732 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:00,761 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 09:16:00,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:00,933 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:00,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2121879648, now seen corresponding path program 47 times [2022-04-28 09:16:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:00,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1091080820] [2022-04-28 09:16:00,935 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:00,936 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2121879648, now seen corresponding path program 48 times [2022-04-28 09:16:00,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:00,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192809958] [2022-04-28 09:16:00,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:00,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:01,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:01,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {14222#(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(14, 2);call #Ultimate.allocInit(12, 3); {14192#true} is VALID [2022-04-28 09:16:01,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {14192#true} assume true; {14192#true} is VALID [2022-04-28 09:16:01,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14192#true} {14192#true} #42#return; {14192#true} is VALID [2022-04-28 09:16:01,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {14192#true} call ULTIMATE.init(); {14222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:01,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {14222#(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(14, 2);call #Ultimate.allocInit(12, 3); {14192#true} is VALID [2022-04-28 09:16:01,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {14192#true} assume true; {14192#true} is VALID [2022-04-28 09:16:01,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14192#true} {14192#true} #42#return; {14192#true} is VALID [2022-04-28 09:16:01,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {14192#true} call #t~ret6 := main(); {14192#true} is VALID [2022-04-28 09:16:01,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {14192#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {14197#(= main_~x~0 0)} is VALID [2022-04-28 09:16:01,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {14197#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {14197#(= main_~x~0 0)} is VALID [2022-04-28 09:16:01,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {14197#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:01,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {14198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {14198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:01,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {14198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14199#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:01,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {14199#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14199#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:01,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {14199#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14200#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:01,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {14200#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {14200#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:01,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {14200#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14201#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:01,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {14201#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14201#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:01,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {14201#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14202#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:01,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {14202#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14202#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:01,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {14202#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14203#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:01,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {14203#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14203#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:01,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {14203#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14204#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:01,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {14204#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {14204#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:01,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {14204#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14205#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:01,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {14205#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14205#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:01,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {14205#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14206#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:01,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {14206#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14206#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:01,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {14206#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:01,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {14207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:01,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {14207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14208#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:01,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {14208#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {14208#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:01,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {14208#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14209#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:01,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {14209#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14209#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:01,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {14209#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14210#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:01,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {14210#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14210#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:01,383 INFO L290 TraceCheckUtils]: 33: Hoare triple {14210#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14211#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:01,383 INFO L290 TraceCheckUtils]: 34: Hoare triple {14211#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {14211#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:01,384 INFO L290 TraceCheckUtils]: 35: Hoare triple {14211#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14212#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:01,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {14212#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {14212#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:01,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {14212#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14213#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:01,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {14213#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14213#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:01,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {14213#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14214#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:01,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {14214#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14214#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:01,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {14214#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14215#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:01,386 INFO L290 TraceCheckUtils]: 42: Hoare triple {14215#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14215#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:01,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {14215#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14216#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:01,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {14216#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14216#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:01,388 INFO L290 TraceCheckUtils]: 45: Hoare triple {14216#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14217#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:01,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {14217#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14217#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:01,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {14217#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14218#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:01,389 INFO L290 TraceCheckUtils]: 48: Hoare triple {14218#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14218#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:01,389 INFO L290 TraceCheckUtils]: 49: Hoare triple {14218#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14219#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:01,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {14219#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {14219#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:01,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {14219#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14220#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:01,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {14220#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {14220#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:01,391 INFO L290 TraceCheckUtils]: 53: Hoare triple {14220#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14221#(and (<= main_~x~0 48) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:16:01,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {14221#(and (<= main_~x~0 48) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {14193#false} is VALID [2022-04-28 09:16:01,391 INFO L272 TraceCheckUtils]: 55: Hoare triple {14193#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14193#false} is VALID [2022-04-28 09:16:01,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {14193#false} ~cond := #in~cond; {14193#false} is VALID [2022-04-28 09:16:01,392 INFO L290 TraceCheckUtils]: 57: Hoare triple {14193#false} assume 0 == ~cond; {14193#false} is VALID [2022-04-28 09:16:01,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {14193#false} assume !false; {14193#false} is VALID [2022-04-28 09:16:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:01,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:01,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192809958] [2022-04-28 09:16:01,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192809958] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:01,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319066397] [2022-04-28 09:16:01,392 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:16:01,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:01,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:01,395 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 09:16:01,395 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 09:16:01,746 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-28 09:16:01,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:01,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 09:16:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:01,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:02,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {14192#true} call ULTIMATE.init(); {14192#true} is VALID [2022-04-28 09:16:02,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {14192#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(14, 2);call #Ultimate.allocInit(12, 3); {14192#true} is VALID [2022-04-28 09:16:02,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {14192#true} assume true; {14192#true} is VALID [2022-04-28 09:16:02,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14192#true} {14192#true} #42#return; {14192#true} is VALID [2022-04-28 09:16:02,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {14192#true} call #t~ret6 := main(); {14192#true} is VALID [2022-04-28 09:16:02,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {14192#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {14197#(= main_~x~0 0)} is VALID [2022-04-28 09:16:02,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {14197#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {14197#(= main_~x~0 0)} is VALID [2022-04-28 09:16:02,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {14197#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:02,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {14198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {14198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:02,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {14198#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14199#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:02,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {14199#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14199#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:02,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {14199#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14200#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:02,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {14200#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {14200#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:02,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {14200#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14201#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:02,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {14201#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14201#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:02,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {14201#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14202#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:02,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {14202#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14202#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:02,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {14202#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14203#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:02,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {14203#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14203#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:02,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {14203#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14204#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:02,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {14204#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {14204#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:02,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {14204#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14205#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:02,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {14205#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14205#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:02,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {14205#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14206#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:02,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {14206#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14206#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:02,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {14206#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:02,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {14207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:02,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {14207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14208#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:02,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {14208#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {14208#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:02,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {14208#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14313#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:02,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {14313#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {14313#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:02,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {14313#(and (<= main_~x~0 24) (<= 24 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14320#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:02,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {14320#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14320#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:02,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {14320#(and (<= main_~x~0 26) (<= (mod main_~y~0 2) 0) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14327#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:02,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {14327#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {14327#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:02,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {14327#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14334#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:02,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {14334#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {14334#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:02,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {14334#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14341#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:02,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {14341#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14341#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:02,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {14341#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14348#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:02,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {14348#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {14348#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:02,540 INFO L290 TraceCheckUtils]: 41: Hoare triple {14348#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14355#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:02,540 INFO L290 TraceCheckUtils]: 42: Hoare triple {14355#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {14355#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:02,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {14355#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14362#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:02,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {14362#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14362#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:02,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {14362#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14369#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:02,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {14369#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14369#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:02,542 INFO L290 TraceCheckUtils]: 47: Hoare triple {14369#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14376#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:02,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {14376#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {14376#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:02,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {14376#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14383#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:02,543 INFO L290 TraceCheckUtils]: 50: Hoare triple {14383#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {14383#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:02,543 INFO L290 TraceCheckUtils]: 51: Hoare triple {14383#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14390#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:02,543 INFO L290 TraceCheckUtils]: 52: Hoare triple {14390#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {14390#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:02,544 INFO L290 TraceCheckUtils]: 53: Hoare triple {14390#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14397#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:02,544 INFO L290 TraceCheckUtils]: 54: Hoare triple {14397#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {14397#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:02,545 INFO L272 TraceCheckUtils]: 55: Hoare triple {14397#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14404#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:02,545 INFO L290 TraceCheckUtils]: 56: Hoare triple {14404#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14408#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:02,545 INFO L290 TraceCheckUtils]: 57: Hoare triple {14408#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14193#false} is VALID [2022-04-28 09:16:02,545 INFO L290 TraceCheckUtils]: 58: Hoare triple {14193#false} assume !false; {14193#false} is VALID [2022-04-28 09:16:02,546 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:02,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:02,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {14193#false} assume !false; {14193#false} is VALID [2022-04-28 09:16:02,837 INFO L290 TraceCheckUtils]: 57: Hoare triple {14408#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14193#false} is VALID [2022-04-28 09:16:02,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {14404#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14408#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:02,838 INFO L272 TraceCheckUtils]: 55: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14404#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:02,838 INFO L290 TraceCheckUtils]: 54: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,839 INFO L290 TraceCheckUtils]: 53: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,839 INFO L290 TraceCheckUtils]: 52: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,839 INFO L290 TraceCheckUtils]: 51: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,839 INFO L290 TraceCheckUtils]: 50: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,840 INFO L290 TraceCheckUtils]: 47: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,841 INFO L290 TraceCheckUtils]: 46: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,841 INFO L290 TraceCheckUtils]: 45: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,842 INFO L290 TraceCheckUtils]: 43: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,842 INFO L290 TraceCheckUtils]: 40: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,843 INFO L290 TraceCheckUtils]: 38: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,843 INFO L290 TraceCheckUtils]: 37: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14424#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:02,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {14503#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {14192#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {14503#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:02,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {14192#true} call #t~ret6 := main(); {14192#true} is VALID [2022-04-28 09:16:02,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14192#true} {14192#true} #42#return; {14192#true} is VALID [2022-04-28 09:16:02,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {14192#true} assume true; {14192#true} is VALID [2022-04-28 09:16:02,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {14192#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(14, 2);call #Ultimate.allocInit(12, 3); {14192#true} is VALID [2022-04-28 09:16:02,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {14192#true} call ULTIMATE.init(); {14192#true} is VALID [2022-04-28 09:16:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 09:16:02,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319066397] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:02,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:02,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 6] total 45 [2022-04-28 09:16:02,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:02,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1091080820] [2022-04-28 09:16:02,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1091080820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:02,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:02,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 09:16:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032265169] [2022-04-28 09:16:02,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:02,854 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 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 09:16:02,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:02,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 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 09:16:02,879 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 09:16:02,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 09:16:02,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:02,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 09:16:02,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1794, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 09:16:02,880 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 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 09:16:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:04,317 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 09:16:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 09:16:04,317 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 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 09:16:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 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 09:16:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 68 transitions. [2022-04-28 09:16:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 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 09:16:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 68 transitions. [2022-04-28 09:16:04,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 68 transitions. [2022-04-28 09:16:04,351 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 09:16:04,352 INFO L225 Difference]: With dead ends: 68 [2022-04-28 09:16:04,352 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 09:16:04,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=358, Invalid=4472, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 09:16:04,353 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:04,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 28 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 09:16:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 09:16:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-28 09:16:04,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:04,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 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 09:16:04,469 INFO L74 IsIncluded]: Start isIncluded. First operand 63 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 09:16:04,469 INFO L87 Difference]: Start difference. First operand 63 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 09:16:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:04,470 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 09:16:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 09:16:04,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:04,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:04,470 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 63 states. [2022-04-28 09:16:04,470 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 63 states. [2022-04-28 09:16:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:04,471 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 09:16:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 09:16:04,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:04,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:04,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:04,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:04,471 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 09:16:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2022-04-28 09:16:04,472 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2022-04-28 09:16:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:04,472 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2022-04-28 09:16:04,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 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 09:16:04,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 62 transitions. [2022-04-28 09:16:04,530 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 09:16:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 09:16:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 09:16:04,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:04,530 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:04,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 09:16:04,736 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,SelfDestructingSolverStorable33 [2022-04-28 09:16:04,737 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:04,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2025090077, now seen corresponding path program 49 times [2022-04-28 09:16:04,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:04,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1134643989] [2022-04-28 09:16:04,739 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:04,739 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:04,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2025090077, now seen corresponding path program 50 times [2022-04-28 09:16:04,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:04,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374558385] [2022-04-28 09:16:04,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:04,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:05,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:05,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {15060#(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(14, 2);call #Ultimate.allocInit(12, 3); {15029#true} is VALID [2022-04-28 09:16:05,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {15029#true} assume true; {15029#true} is VALID [2022-04-28 09:16:05,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15029#true} {15029#true} #42#return; {15029#true} is VALID [2022-04-28 09:16:05,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {15029#true} call ULTIMATE.init(); {15060#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:05,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {15060#(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(14, 2);call #Ultimate.allocInit(12, 3); {15029#true} is VALID [2022-04-28 09:16:05,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {15029#true} assume true; {15029#true} is VALID [2022-04-28 09:16:05,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15029#true} {15029#true} #42#return; {15029#true} is VALID [2022-04-28 09:16:05,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {15029#true} call #t~ret6 := main(); {15029#true} is VALID [2022-04-28 09:16:05,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {15029#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {15034#(= main_~x~0 0)} is VALID [2022-04-28 09:16:05,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {15034#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {15034#(= main_~x~0 0)} is VALID [2022-04-28 09:16:05,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {15034#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15035#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:05,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {15035#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {15035#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:05,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {15035#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15036#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:05,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {15036#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15036#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:05,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {15036#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15037#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:05,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {15037#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {15037#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:05,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {15037#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15038#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:05,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {15038#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15038#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:05,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {15038#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15039#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:05,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {15039#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15039#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:05,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {15039#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15040#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:05,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {15040#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15040#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:05,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {15040#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15041#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:05,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {15041#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {15041#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:05,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {15041#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15042#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:05,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {15042#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15042#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:05,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {15042#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15043#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:05,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {15043#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15043#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:05,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {15043#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15044#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:05,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {15044#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15044#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:05,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {15044#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15045#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:05,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {15045#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {15045#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:05,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {15045#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15046#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:05,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {15046#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15046#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:05,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {15046#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15047#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:05,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {15047#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15047#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:05,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {15047#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15048#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:05,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {15048#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {15048#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:05,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {15048#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15049#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:05,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {15049#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {15049#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:05,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {15049#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15050#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:05,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {15050#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15050#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:05,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {15050#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15051#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:05,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {15051#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15051#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:05,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {15051#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15052#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:05,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {15052#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15052#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:05,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {15052#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15053#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:05,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {15053#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15053#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:05,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {15053#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15054#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:05,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {15054#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15054#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:05,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {15054#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15055#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:05,223 INFO L290 TraceCheckUtils]: 48: Hoare triple {15055#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15055#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:05,223 INFO L290 TraceCheckUtils]: 49: Hoare triple {15055#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15056#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:05,223 INFO L290 TraceCheckUtils]: 50: Hoare triple {15056#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {15056#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:05,224 INFO L290 TraceCheckUtils]: 51: Hoare triple {15056#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15057#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:05,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {15057#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {15057#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:05,224 INFO L290 TraceCheckUtils]: 53: Hoare triple {15057#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15058#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:05,225 INFO L290 TraceCheckUtils]: 54: Hoare triple {15058#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15058#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:05,225 INFO L290 TraceCheckUtils]: 55: Hoare triple {15058#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15059#(and (<= main_~x~0 50) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:16:05,225 INFO L290 TraceCheckUtils]: 56: Hoare triple {15059#(and (<= main_~x~0 50) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {15030#false} is VALID [2022-04-28 09:16:05,225 INFO L272 TraceCheckUtils]: 57: Hoare triple {15030#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15030#false} is VALID [2022-04-28 09:16:05,226 INFO L290 TraceCheckUtils]: 58: Hoare triple {15030#false} ~cond := #in~cond; {15030#false} is VALID [2022-04-28 09:16:05,226 INFO L290 TraceCheckUtils]: 59: Hoare triple {15030#false} assume 0 == ~cond; {15030#false} is VALID [2022-04-28 09:16:05,226 INFO L290 TraceCheckUtils]: 60: Hoare triple {15030#false} assume !false; {15030#false} is VALID [2022-04-28 09:16:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:05,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374558385] [2022-04-28 09:16:05,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374558385] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769047458] [2022-04-28 09:16:05,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:16:05,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:05,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:05,244 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 09:16:05,266 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 09:16:05,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:16:05,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:05,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 09:16:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:05,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:06,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {15029#true} call ULTIMATE.init(); {15029#true} is VALID [2022-04-28 09:16:06,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {15029#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(14, 2);call #Ultimate.allocInit(12, 3); {15029#true} is VALID [2022-04-28 09:16:06,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {15029#true} assume true; {15029#true} is VALID [2022-04-28 09:16:06,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15029#true} {15029#true} #42#return; {15029#true} is VALID [2022-04-28 09:16:06,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {15029#true} call #t~ret6 := main(); {15029#true} is VALID [2022-04-28 09:16:06,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {15029#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {15034#(= main_~x~0 0)} is VALID [2022-04-28 09:16:06,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {15034#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {15034#(= main_~x~0 0)} is VALID [2022-04-28 09:16:06,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {15034#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15085#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:16:06,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {15085#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {15085#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:16:06,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {15085#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15092#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:06,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {15092#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {15092#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:06,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {15092#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15099#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:16:06,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {15099#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {15099#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:16:06,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {15099#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15106#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {15106#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15106#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {15106#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15113#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:16:06,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {15113#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < 99); {15113#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:16:06,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {15113#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15120#(and (= 6 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {15120#(and (= 6 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15120#(and (= 6 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {15120#(and (= 6 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15127#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {15127#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15127#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {15127#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15134#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {15134#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15134#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {15134#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15141#(and (= 14 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {15141#(and (= 14 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15141#(and (= 14 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {15141#(and (= 14 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15148#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {15148#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15148#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {15148#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15155#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {15155#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15155#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {15155#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15162#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {15162#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15162#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {15162#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15169#(and (= 22 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {15169#(and (= 22 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15169#(and (= 22 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {15169#(and (= 22 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15176#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {15176#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15176#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {15176#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15183#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:16:06,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {15183#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15183#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:16:06,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {15183#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15190#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {15190#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15190#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,253 INFO L290 TraceCheckUtils]: 39: Hoare triple {15190#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15197#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {15197#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15197#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,253 INFO L290 TraceCheckUtils]: 41: Hoare triple {15197#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15204#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:16:06,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {15204#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume !!(~x~0 % 4294967296 < 99); {15204#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:16:06,254 INFO L290 TraceCheckUtils]: 43: Hoare triple {15204#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15211#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {15211#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15211#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {15211#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15218#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {15218#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15218#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {15218#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15225#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:16:06,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {15225#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15225#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:16:06,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {15225#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15232#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {15232#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15232#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {15232#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15239#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:16:06,256 INFO L290 TraceCheckUtils]: 52: Hoare triple {15239#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {15239#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:16:06,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {15239#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15246#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} is VALID [2022-04-28 09:16:06,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {15246#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} assume !!(~x~0 % 4294967296 < 99); {15246#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} is VALID [2022-04-28 09:16:06,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {15246#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15253#(and (= 48 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {15253#(and (= 48 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {15253#(and (= 48 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:06,258 INFO L272 TraceCheckUtils]: 57: Hoare triple {15253#(and (= 48 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15260#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:06,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {15260#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15264#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:06,258 INFO L290 TraceCheckUtils]: 59: Hoare triple {15264#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15030#false} is VALID [2022-04-28 09:16:06,258 INFO L290 TraceCheckUtils]: 60: Hoare triple {15030#false} assume !false; {15030#false} is VALID [2022-04-28 09:16:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:06,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:06,562 INFO L290 TraceCheckUtils]: 60: Hoare triple {15030#false} assume !false; {15030#false} is VALID [2022-04-28 09:16:06,562 INFO L290 TraceCheckUtils]: 59: Hoare triple {15264#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15030#false} is VALID [2022-04-28 09:16:06,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {15260#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15264#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:06,563 INFO L272 TraceCheckUtils]: 57: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15260#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:06,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,563 INFO L290 TraceCheckUtils]: 55: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,563 INFO L290 TraceCheckUtils]: 54: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,564 INFO L290 TraceCheckUtils]: 53: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,564 INFO L290 TraceCheckUtils]: 52: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,564 INFO L290 TraceCheckUtils]: 51: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,565 INFO L290 TraceCheckUtils]: 50: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,565 INFO L290 TraceCheckUtils]: 49: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,565 INFO L290 TraceCheckUtils]: 48: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {15431#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15280#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:06,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {15431#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {15431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:06,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {15029#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {15431#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:06,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {15029#true} call #t~ret6 := main(); {15029#true} is VALID [2022-04-28 09:16:06,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15029#true} {15029#true} #42#return; {15029#true} is VALID [2022-04-28 09:16:06,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {15029#true} assume true; {15029#true} is VALID [2022-04-28 09:16:06,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {15029#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(14, 2);call #Ultimate.allocInit(12, 3); {15029#true} is VALID [2022-04-28 09:16:06,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {15029#true} call ULTIMATE.init(); {15029#true} is VALID [2022-04-28 09:16:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-04-28 09:16:06,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769047458] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:06,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:06,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 6] total 58 [2022-04-28 09:16:06,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:06,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1134643989] [2022-04-28 09:16:06,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1134643989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:06,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:06,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 09:16:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69785687] [2022-04-28 09:16:06,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:06,579 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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 09:16:06,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:06,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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 09:16:06,606 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 09:16:06,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 09:16:06,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:06,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 09:16:06,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=3044, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 09:16:06,607 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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 09:16:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:08,407 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 09:16:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 09:16:08,407 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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 09:16:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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 09:16:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 70 transitions. [2022-04-28 09:16:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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 09:16:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 70 transitions. [2022-04-28 09:16:08,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 70 transitions. [2022-04-28 09:16:08,462 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 09:16:08,463 INFO L225 Difference]: With dead ends: 70 [2022-04-28 09:16:08,463 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 09:16:08,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1428 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=441, Invalid=6531, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 09:16:08,464 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:08,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 103 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 09:16:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 09:16:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-04-28 09:16:08,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:08,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 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 09:16:08,679 INFO L74 IsIncluded]: Start isIncluded. First operand 65 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 09:16:08,679 INFO L87 Difference]: Start difference. First operand 65 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 09:16:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:08,680 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 09:16:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 09:16:08,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:08,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:08,680 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 65 states. [2022-04-28 09:16:08,680 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 65 states. [2022-04-28 09:16:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:08,681 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 09:16:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 09:16:08,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:08,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:08,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:08,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:08,681 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 09:16:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2022-04-28 09:16:08,682 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2022-04-28 09:16:08,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:08,682 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2022-04-28 09:16:08,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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 09:16:08,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 64 transitions. [2022-04-28 09:16:08,762 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 09:16:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 09:16:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 09:16:08,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:08,763 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:08,780 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 09:16:08,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:08,963 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:08,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1533345114, now seen corresponding path program 51 times [2022-04-28 09:16:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:08,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1710300817] [2022-04-28 09:16:08,966 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:08,966 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:08,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1533345114, now seen corresponding path program 52 times [2022-04-28 09:16:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:08,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909426693] [2022-04-28 09:16:08,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:08,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:09,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:09,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {15937#(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(14, 2);call #Ultimate.allocInit(12, 3); {15905#true} is VALID [2022-04-28 09:16:09,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {15905#true} assume true; {15905#true} is VALID [2022-04-28 09:16:09,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15905#true} {15905#true} #42#return; {15905#true} is VALID [2022-04-28 09:16:09,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {15905#true} call ULTIMATE.init(); {15937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:09,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {15937#(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(14, 2);call #Ultimate.allocInit(12, 3); {15905#true} is VALID [2022-04-28 09:16:09,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {15905#true} assume true; {15905#true} is VALID [2022-04-28 09:16:09,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15905#true} {15905#true} #42#return; {15905#true} is VALID [2022-04-28 09:16:09,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {15905#true} call #t~ret6 := main(); {15905#true} is VALID [2022-04-28 09:16:09,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {15905#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {15910#(= main_~x~0 0)} is VALID [2022-04-28 09:16:09,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {15910#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {15910#(= main_~x~0 0)} is VALID [2022-04-28 09:16:09,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {15910#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15911#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:09,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {15911#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {15911#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:09,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {15911#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15912#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:09,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {15912#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15912#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:09,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {15912#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15913#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:09,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {15913#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {15913#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:09,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {15913#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15914#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:09,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {15914#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15914#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:09,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {15914#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15915#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:09,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {15915#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15915#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:09,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {15915#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15916#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:09,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {15916#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15916#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:09,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {15916#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15917#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:09,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {15917#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {15917#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:09,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {15917#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15918#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:09,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {15918#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15918#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:09,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {15918#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15919#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:09,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {15919#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15919#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:09,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {15919#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15920#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:09,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {15920#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15920#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:09,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {15920#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15921#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:09,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {15921#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {15921#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:09,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {15921#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15922#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:09,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {15922#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15922#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:09,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {15922#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15923#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:09,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {15923#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15923#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:09,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {15923#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15924#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:09,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {15924#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {15924#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:09,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {15924#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15925#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:09,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {15925#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {15925#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:09,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {15925#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15926#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:09,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {15926#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15926#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:09,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {15926#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15927#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:09,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {15927#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15927#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:09,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {15927#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15928#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:09,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {15928#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15928#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:09,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {15928#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15929#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:09,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {15929#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15929#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:09,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {15929#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15930#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:09,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {15930#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15930#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:09,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {15930#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15931#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:09,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {15931#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15931#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:09,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {15931#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15932#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:09,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {15932#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {15932#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:09,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {15932#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15933#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:09,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {15933#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {15933#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:09,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {15933#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15934#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:09,506 INFO L290 TraceCheckUtils]: 54: Hoare triple {15934#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15934#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:09,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {15934#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15935#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:09,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {15935#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15935#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:09,508 INFO L290 TraceCheckUtils]: 57: Hoare triple {15935#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15936#(and (<= main_~x~0 52) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:16:09,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {15936#(and (<= main_~x~0 52) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {15906#false} is VALID [2022-04-28 09:16:09,508 INFO L272 TraceCheckUtils]: 59: Hoare triple {15906#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15906#false} is VALID [2022-04-28 09:16:09,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {15906#false} ~cond := #in~cond; {15906#false} is VALID [2022-04-28 09:16:09,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {15906#false} assume 0 == ~cond; {15906#false} is VALID [2022-04-28 09:16:09,508 INFO L290 TraceCheckUtils]: 62: Hoare triple {15906#false} assume !false; {15906#false} is VALID [2022-04-28 09:16:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:09,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:09,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909426693] [2022-04-28 09:16:09,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909426693] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:09,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226034634] [2022-04-28 09:16:09,509 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:16:09,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:09,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:09,510 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 09:16:09,511 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 09:16:09,544 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:16:09,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:09,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-28 09:16:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:09,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:10,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {15905#true} call ULTIMATE.init(); {15905#true} is VALID [2022-04-28 09:16:10,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {15905#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(14, 2);call #Ultimate.allocInit(12, 3); {15905#true} is VALID [2022-04-28 09:16:10,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {15905#true} assume true; {15905#true} is VALID [2022-04-28 09:16:10,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15905#true} {15905#true} #42#return; {15905#true} is VALID [2022-04-28 09:16:10,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {15905#true} call #t~ret6 := main(); {15905#true} is VALID [2022-04-28 09:16:10,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {15905#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {15910#(= main_~x~0 0)} is VALID [2022-04-28 09:16:10,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {15910#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {15910#(= main_~x~0 0)} is VALID [2022-04-28 09:16:10,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {15910#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15962#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {15962#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15962#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {15962#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15969#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:16:10,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {15969#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume !!(~x~0 % 4294967296 < 99); {15969#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:16:10,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {15969#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15976#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:16:10,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {15976#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {15976#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:16:10,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {15976#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15983#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {15983#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15983#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {15983#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15990#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {15990#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15990#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {15990#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {15997#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {15997#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {15997#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {15997#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16004#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {16004#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16004#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {16004#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16011#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-28 09:16:10,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {16011#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume !!(~x~0 % 4294967296 < 99); {16011#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-28 09:16:10,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {16011#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16018#(and (<= (mod main_~y~0 2) 0) (= 16 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:10,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {16018#(and (<= (mod main_~y~0 2) 0) (= 16 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {16018#(and (<= (mod main_~y~0 2) 0) (= 16 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:10,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {16018#(and (<= (mod main_~y~0 2) 0) (= 16 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16025#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {16025#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16025#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {16025#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16032#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {16032#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16032#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {16032#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16039#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {16039#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16039#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {16039#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16046#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:16:10,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {16046#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 99); {16046#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:16:10,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {16046#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16053#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,776 INFO L290 TraceCheckUtils]: 34: Hoare triple {16053#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16053#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {16053#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16060#(and (= 28 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {16060#(and (= 28 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16060#(and (= 28 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,777 INFO L290 TraceCheckUtils]: 37: Hoare triple {16060#(and (= 28 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16067#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {16067#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16067#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {16067#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16074#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:16:10,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {16074#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {16074#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:16:10,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {16074#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16081#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {16081#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16081#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {16081#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16088#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {16088#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16088#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {16088#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16095#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {16095#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16095#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {16095#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16102#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:16:10,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {16102#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16102#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:16:10,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {16102#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16109#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:10,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {16109#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {16109#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:10,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {16109#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16116#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:16:10,782 INFO L290 TraceCheckUtils]: 52: Hoare triple {16116#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {16116#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:16:10,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {16116#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16123#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:10,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {16123#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {16123#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:10,784 INFO L290 TraceCheckUtils]: 55: Hoare triple {16123#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16130#(and (<= (mod main_~y~0 2) 0) (= 46 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:16:10,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {16130#(and (<= (mod main_~y~0 2) 0) (= 46 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < 99); {16130#(and (<= (mod main_~y~0 2) 0) (= 46 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:16:10,784 INFO L290 TraceCheckUtils]: 57: Hoare triple {16130#(and (<= (mod main_~y~0 2) 0) (= 46 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16137#(and (= 46 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {16137#(and (= 46 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {16137#(and (= 46 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:10,785 INFO L272 TraceCheckUtils]: 59: Hoare triple {16137#(and (= 46 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16144#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:10,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {16144#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16148#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:10,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {16148#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15906#false} is VALID [2022-04-28 09:16:10,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {15906#false} assume !false; {15906#false} is VALID [2022-04-28 09:16:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:10,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:11,223 INFO L290 TraceCheckUtils]: 62: Hoare triple {15906#false} assume !false; {15906#false} is VALID [2022-04-28 09:16:11,223 INFO L290 TraceCheckUtils]: 61: Hoare triple {16148#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15906#false} is VALID [2022-04-28 09:16:11,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {16144#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16148#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:11,224 INFO L272 TraceCheckUtils]: 59: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16144#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:11,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,225 INFO L290 TraceCheckUtils]: 57: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,225 INFO L290 TraceCheckUtils]: 56: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,227 INFO L290 TraceCheckUtils]: 53: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,230 INFO L290 TraceCheckUtils]: 45: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,230 INFO L290 TraceCheckUtils]: 44: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,231 INFO L290 TraceCheckUtils]: 42: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,231 INFO L290 TraceCheckUtils]: 41: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {16321#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16164#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:11,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {16321#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {16321#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:11,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {15905#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {16321#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:11,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {15905#true} call #t~ret6 := main(); {15905#true} is VALID [2022-04-28 09:16:11,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15905#true} {15905#true} #42#return; {15905#true} is VALID [2022-04-28 09:16:11,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {15905#true} assume true; {15905#true} is VALID [2022-04-28 09:16:11,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {15905#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(14, 2);call #Ultimate.allocInit(12, 3); {15905#true} is VALID [2022-04-28 09:16:11,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {15905#true} call ULTIMATE.init(); {15905#true} is VALID [2022-04-28 09:16:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-04-28 09:16:11,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226034634] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:11,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:11,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 6] total 60 [2022-04-28 09:16:11,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:11,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1710300817] [2022-04-28 09:16:11,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1710300817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:11,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:11,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 09:16:11,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438112310] [2022-04-28 09:16:11,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:11,247 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 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 09:16:11,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:11,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 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 09:16:11,290 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 09:16:11,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 09:16:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:11,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 09:16:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3268, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 09:16:11,291 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 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 09:16:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:13,366 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 09:16:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 09:16:13,366 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 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 09:16:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 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 09:16:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions. [2022-04-28 09:16:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 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 09:16:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions. [2022-04-28 09:16:13,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 72 transitions. [2022-04-28 09:16:13,406 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 09:16:13,407 INFO L225 Difference]: With dead ends: 72 [2022-04-28 09:16:13,407 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 09:16:13,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=458, Invalid=7024, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 09:16:13,409 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:13,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 83 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 09:16:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 09:16:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-28 09:16:13,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:13,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 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 09:16:13,548 INFO L74 IsIncluded]: Start isIncluded. First operand 67 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 09:16:13,548 INFO L87 Difference]: Start difference. First operand 67 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 09:16:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:13,549 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 09:16:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 09:16:13,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:13,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:13,549 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 67 states. [2022-04-28 09:16:13,550 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 67 states. [2022-04-28 09:16:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:13,550 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 09:16:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 09:16:13,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:13,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:13,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:13,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:13,551 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 09:16:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2022-04-28 09:16:13,552 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2022-04-28 09:16:13,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:13,552 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2022-04-28 09:16:13,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 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 09:16:13,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 66 transitions. [2022-04-28 09:16:13,621 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 09:16:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 09:16:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 09:16:13,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:13,623 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:13,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-28 09:16:13,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:13,839 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:13,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1412838231, now seen corresponding path program 53 times [2022-04-28 09:16:13,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:13,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1498129456] [2022-04-28 09:16:13,841 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:13,842 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1412838231, now seen corresponding path program 54 times [2022-04-28 09:16:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:13,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574421998] [2022-04-28 09:16:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:14,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:14,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {16842#(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(14, 2);call #Ultimate.allocInit(12, 3); {16809#true} is VALID [2022-04-28 09:16:14,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {16809#true} assume true; {16809#true} is VALID [2022-04-28 09:16:14,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16809#true} {16809#true} #42#return; {16809#true} is VALID [2022-04-28 09:16:14,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {16809#true} call ULTIMATE.init(); {16842#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:14,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {16842#(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(14, 2);call #Ultimate.allocInit(12, 3); {16809#true} is VALID [2022-04-28 09:16:14,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {16809#true} assume true; {16809#true} is VALID [2022-04-28 09:16:14,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16809#true} {16809#true} #42#return; {16809#true} is VALID [2022-04-28 09:16:14,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {16809#true} call #t~ret6 := main(); {16809#true} is VALID [2022-04-28 09:16:14,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {16809#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {16814#(= main_~x~0 0)} is VALID [2022-04-28 09:16:14,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {16814#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {16814#(= main_~x~0 0)} is VALID [2022-04-28 09:16:14,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {16814#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16815#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:14,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {16815#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {16815#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:14,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {16815#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16816#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:14,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {16816#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16816#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:14,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {16816#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16817#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:14,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {16817#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {16817#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:14,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {16817#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16818#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:14,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {16818#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16818#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:14,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {16818#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16819#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:14,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {16819#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16819#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:14,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {16819#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16820#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:14,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {16820#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16820#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:14,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {16820#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16821#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:14,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {16821#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {16821#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:14,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {16821#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16822#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:14,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {16822#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16822#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:14,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {16822#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16823#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:14,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {16823#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16823#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:14,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {16823#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16824#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:14,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {16824#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16824#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:14,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {16824#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16825#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:14,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {16825#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {16825#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:14,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {16825#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:14,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {16826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:14,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {16826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16827#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:14,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {16827#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16827#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:14,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {16827#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16828#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:14,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {16828#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {16828#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:14,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {16828#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16829#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:14,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {16829#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {16829#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:14,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {16829#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16830#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:14,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {16830#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16830#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:14,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {16830#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16831#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:14,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {16831#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16831#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:14,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {16831#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16832#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:14,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {16832#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16832#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:14,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {16832#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16833#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:14,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {16833#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16833#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:14,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {16833#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16834#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:14,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {16834#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16834#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:14,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {16834#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16835#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:14,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {16835#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16835#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:14,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {16835#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16836#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:14,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {16836#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {16836#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:14,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {16836#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16837#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:14,378 INFO L290 TraceCheckUtils]: 52: Hoare triple {16837#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {16837#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:14,378 INFO L290 TraceCheckUtils]: 53: Hoare triple {16837#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16838#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:14,379 INFO L290 TraceCheckUtils]: 54: Hoare triple {16838#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16838#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:14,379 INFO L290 TraceCheckUtils]: 55: Hoare triple {16838#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16839#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:14,379 INFO L290 TraceCheckUtils]: 56: Hoare triple {16839#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16839#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:14,380 INFO L290 TraceCheckUtils]: 57: Hoare triple {16839#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16840#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:14,380 INFO L290 TraceCheckUtils]: 58: Hoare triple {16840#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16840#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:14,381 INFO L290 TraceCheckUtils]: 59: Hoare triple {16840#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16841#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 54))} is VALID [2022-04-28 09:16:14,381 INFO L290 TraceCheckUtils]: 60: Hoare triple {16841#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 54))} assume !(~x~0 % 4294967296 < 99); {16810#false} is VALID [2022-04-28 09:16:14,381 INFO L272 TraceCheckUtils]: 61: Hoare triple {16810#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16810#false} is VALID [2022-04-28 09:16:14,381 INFO L290 TraceCheckUtils]: 62: Hoare triple {16810#false} ~cond := #in~cond; {16810#false} is VALID [2022-04-28 09:16:14,381 INFO L290 TraceCheckUtils]: 63: Hoare triple {16810#false} assume 0 == ~cond; {16810#false} is VALID [2022-04-28 09:16:14,381 INFO L290 TraceCheckUtils]: 64: Hoare triple {16810#false} assume !false; {16810#false} is VALID [2022-04-28 09:16:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:14,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:14,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574421998] [2022-04-28 09:16:14,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574421998] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:14,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321355870] [2022-04-28 09:16:14,382 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:16:14,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:14,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:14,383 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 09:16:14,384 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 09:16:15,070 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-28 09:16:15,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:15,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-28 09:16:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:15,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:15,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {16809#true} call ULTIMATE.init(); {16809#true} is VALID [2022-04-28 09:16:15,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {16809#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(14, 2);call #Ultimate.allocInit(12, 3); {16809#true} is VALID [2022-04-28 09:16:15,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {16809#true} assume true; {16809#true} is VALID [2022-04-28 09:16:15,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16809#true} {16809#true} #42#return; {16809#true} is VALID [2022-04-28 09:16:15,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {16809#true} call #t~ret6 := main(); {16809#true} is VALID [2022-04-28 09:16:15,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {16809#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {16814#(= main_~x~0 0)} is VALID [2022-04-28 09:16:15,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {16814#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {16814#(= main_~x~0 0)} is VALID [2022-04-28 09:16:15,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {16814#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16815#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:15,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {16815#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {16815#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:15,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {16815#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16816#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:15,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {16816#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16816#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:15,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {16816#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16817#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:15,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {16817#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {16817#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:15,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {16817#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16818#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:15,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {16818#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16818#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:15,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {16818#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16819#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:15,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {16819#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16819#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:16,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {16819#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16820#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:16,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {16820#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16820#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:16,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {16820#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16821#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:16,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {16821#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {16821#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:16,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {16821#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16822#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:16,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {16822#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16822#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:16,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {16822#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16823#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:16,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {16823#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16823#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:16,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {16823#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16824#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:16,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {16824#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16824#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:16,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {16824#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16825#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:16,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {16825#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {16825#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:16,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {16825#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:16,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {16826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:16,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {16826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16827#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:16,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {16827#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16827#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:16,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {16827#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16945#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {16945#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16945#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {16945#(and (<= 28 main_~x~0) (<= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16952#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {16952#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16952#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {16952#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16959#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:16,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {16959#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16959#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:16,009 INFO L290 TraceCheckUtils]: 39: Hoare triple {16959#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16966#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {16966#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16966#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {16966#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16973#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {16973#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16973#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,011 INFO L290 TraceCheckUtils]: 43: Hoare triple {16973#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16980#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:16,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {16980#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16980#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:16,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {16980#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16987#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:16,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {16987#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16987#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:16,012 INFO L290 TraceCheckUtils]: 47: Hoare triple {16987#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {16994#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {16994#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {16994#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {16994#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17001#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:16,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {17001#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {17001#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:16,014 INFO L290 TraceCheckUtils]: 51: Hoare triple {17001#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17008#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:16,014 INFO L290 TraceCheckUtils]: 52: Hoare triple {17008#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {17008#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:16,015 INFO L290 TraceCheckUtils]: 53: Hoare triple {17008#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17015#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:16,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {17015#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17015#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:16,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {17015#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17022#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {17022#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {17022#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,017 INFO L290 TraceCheckUtils]: 57: Hoare triple {17022#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17029#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,017 INFO L290 TraceCheckUtils]: 58: Hoare triple {17029#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {17029#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:16,018 INFO L290 TraceCheckUtils]: 59: Hoare triple {17029#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17036#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:16,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {17036#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {16810#false} is VALID [2022-04-28 09:16:16,018 INFO L272 TraceCheckUtils]: 61: Hoare triple {16810#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16810#false} is VALID [2022-04-28 09:16:16,018 INFO L290 TraceCheckUtils]: 62: Hoare triple {16810#false} ~cond := #in~cond; {16810#false} is VALID [2022-04-28 09:16:16,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {16810#false} assume 0 == ~cond; {16810#false} is VALID [2022-04-28 09:16:16,018 INFO L290 TraceCheckUtils]: 64: Hoare triple {16810#false} assume !false; {16810#false} is VALID [2022-04-28 09:16:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:16,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:20,722 INFO L290 TraceCheckUtils]: 64: Hoare triple {16810#false} assume !false; {16810#false} is VALID [2022-04-28 09:16:20,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {17055#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16810#false} is VALID [2022-04-28 09:16:20,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {17059#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17055#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:16:20,724 INFO L272 TraceCheckUtils]: 61: Hoare triple {17063#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17059#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:20,724 INFO L290 TraceCheckUtils]: 60: Hoare triple {17067#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !(~x~0 % 4294967296 < 99); {17063#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:20,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {17071#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17067#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:16:20,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {17075#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99) (not (< (mod main_~x~0 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {17071#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-28 09:16:20,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {17079#(or (not (< (mod (+ main_~x~0 2) 4294967296) 99)) (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17075#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-28 09:16:20,727 INFO L290 TraceCheckUtils]: 56: Hoare triple {17079#(or (not (< (mod (+ main_~x~0 2) 4294967296) 99)) (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {17079#(or (not (< (mod (+ main_~x~0 2) 4294967296) 99)) (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:16:20,728 INFO L290 TraceCheckUtils]: 55: Hoare triple {17086#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 4) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17079#(or (not (< (mod (+ main_~x~0 2) 4294967296) 99)) (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:16:20,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {17086#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 4) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {17086#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 4) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {17093#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 6) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17086#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 4) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {17093#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 6) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {17093#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 6) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {17100#(or (not (< (mod (+ main_~x~0 8) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17093#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 6) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,731 INFO L290 TraceCheckUtils]: 50: Hoare triple {17100#(or (not (< (mod (+ main_~x~0 8) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {17100#(or (not (< (mod (+ main_~x~0 8) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-28 09:16:20,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {17107#(or (not (< (mod (+ main_~x~0 10) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17100#(or (not (< (mod (+ main_~x~0 8) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-28 09:16:20,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {17107#(or (not (< (mod (+ main_~x~0 10) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {17107#(or (not (< (mod (+ main_~x~0 10) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-28 09:16:20,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {17114#(or (not (< (mod (+ main_~x~0 12) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17107#(or (not (< (mod (+ main_~x~0 10) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-28 09:16:20,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {17114#(or (not (< (mod (+ main_~x~0 12) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {17114#(or (not (< (mod (+ main_~x~0 12) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-28 09:16:20,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {17121#(or (not (< (mod (+ main_~x~0 14) 4294967296) 99)) (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17114#(or (not (< (mod (+ main_~x~0 12) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-28 09:16:20,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {17121#(or (not (< (mod (+ main_~x~0 14) 4294967296) 99)) (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {17121#(or (not (< (mod (+ main_~x~0 14) 4294967296) 99)) (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:16:20,736 INFO L290 TraceCheckUtils]: 43: Hoare triple {17128#(or (not (< (mod (+ main_~x~0 16) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17121#(or (not (< (mod (+ main_~x~0 14) 4294967296) 99)) (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:16:20,736 INFO L290 TraceCheckUtils]: 42: Hoare triple {17128#(or (not (< (mod (+ main_~x~0 16) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {17128#(or (not (< (mod (+ main_~x~0 16) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-28 09:16:20,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {17135#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (not (< (mod (+ main_~x~0 18) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17128#(or (not (< (mod (+ main_~x~0 16) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-28 09:16:20,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {17135#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (not (< (mod (+ main_~x~0 18) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {17135#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (not (< (mod (+ main_~x~0 18) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:16:20,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {17142#(or (not (< (mod (+ main_~x~0 20) 4294967296) 99)) (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17135#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (not (< (mod (+ main_~x~0 18) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:16:20,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {17142#(or (not (< (mod (+ main_~x~0 20) 4294967296) 99)) (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {17142#(or (not (< (mod (+ main_~x~0 20) 4294967296) 99)) (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:16:20,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {17149#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (not (< (mod (+ main_~x~0 22) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17142#(or (not (< (mod (+ main_~x~0 20) 4294967296) 99)) (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:16:20,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {17149#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (not (< (mod (+ main_~x~0 22) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {17149#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (not (< (mod (+ main_~x~0 22) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:16:20,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {17156#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 24) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17149#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (not (< (mod (+ main_~x~0 22) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:16:20,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {17156#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 24) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {17156#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 24) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {17163#(or (not (< (mod (+ main_~x~0 26) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 28) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17156#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 24) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {17163#(or (not (< (mod (+ main_~x~0 26) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 28) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {17163#(or (not (< (mod (+ main_~x~0 26) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-28 09:16:20,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {17170#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 28) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17163#(or (not (< (mod (+ main_~x~0 26) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-28 09:16:20,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {17170#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 28) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {17170#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 28) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {17177#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 99)) (< (mod (+ 32 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17170#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 28) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {17177#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 99)) (< (mod (+ 32 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {17177#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 99)) (< (mod (+ 32 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:20,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {17184#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ 32 main_~x~0) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17177#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 99)) (< (mod (+ 32 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:20,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {17184#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ 32 main_~x~0) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {17184#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ 32 main_~x~0) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {17191#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 34) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17184#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ 32 main_~x~0) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {17191#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 34) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {17191#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 34) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {17198#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (not (< (mod (+ main_~x~0 36) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17191#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 34) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {17198#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (not (< (mod (+ main_~x~0 36) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {17198#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (not (< (mod (+ main_~x~0 36) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:20,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {17205#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 38) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17198#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (not (< (mod (+ main_~x~0 36) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:20,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {17205#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 38) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {17205#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 38) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:20,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {17212#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ 40 main_~x~0) 4294967296) 99)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17205#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 38) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:20,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {17212#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ 40 main_~x~0) 4294967296) 99)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {17212#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ 40 main_~x~0) 4294967296) 99)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:16:20,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {17219#(or (not (< (mod (+ 42 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 44 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17212#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ 40 main_~x~0) 4294967296) 99)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:16:20,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {17219#(or (not (< (mod (+ 42 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 44 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {17219#(or (not (< (mod (+ 42 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 44 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:16:20,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {17226#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17219#(or (not (< (mod (+ 42 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 44 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:16:20,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {17226#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {17226#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:20,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {17233#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (not (< (mod (+ main_~x~0 46) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17226#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:20,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {17233#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (not (< (mod (+ main_~x~0 46) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {17233#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (not (< (mod (+ main_~x~0 46) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:20,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {17240#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99) (not (< (mod (+ main_~x~0 48) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17233#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (not (< (mod (+ main_~x~0 46) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:20,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {17240#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99) (not (< (mod (+ main_~x~0 48) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {17240#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99) (not (< (mod (+ main_~x~0 48) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {17247#(or (not (< (mod (+ main_~x~0 50) 4294967296) 99)) (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17240#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99) (not (< (mod (+ main_~x~0 48) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {17247#(or (not (< (mod (+ main_~x~0 50) 4294967296) 99)) (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {17247#(or (not (< (mod (+ main_~x~0 50) 4294967296) 99)) (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:20,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {17254#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 52) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17247#(or (not (< (mod (+ main_~x~0 50) 4294967296) 99)) (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:16:20,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {17254#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 52) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {17254#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 52) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {16809#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {17254#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 52) 4294967296) 99)))} is VALID [2022-04-28 09:16:20,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {16809#true} call #t~ret6 := main(); {16809#true} is VALID [2022-04-28 09:16:20,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16809#true} {16809#true} #42#return; {16809#true} is VALID [2022-04-28 09:16:20,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {16809#true} assume true; {16809#true} is VALID [2022-04-28 09:16:20,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {16809#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(14, 2);call #Ultimate.allocInit(12, 3); {16809#true} is VALID [2022-04-28 09:16:20,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {16809#true} call ULTIMATE.init(); {16809#true} is VALID [2022-04-28 09:16:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:20,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321355870] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:20,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:20,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 34] total 77 [2022-04-28 09:16:20,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:20,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1498129456] [2022-04-28 09:16:20,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1498129456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:20,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:20,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 09:16:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421923815] [2022-04-28 09:16:20,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 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 09:16:20,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:20,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 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 09:16:20,820 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 09:16:20,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 09:16:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:20,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 09:16:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1448, Invalid=4404, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 09:16:20,822 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 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 09:16:23,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:23,568 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 09:16:23,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 09:16:23,568 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 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 09:16:23,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 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 09:16:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 74 transitions. [2022-04-28 09:16:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 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 09:16:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 74 transitions. [2022-04-28 09:16:23,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 74 transitions. [2022-04-28 09:16:23,640 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 09:16:23,641 INFO L225 Difference]: With dead ends: 74 [2022-04-28 09:16:23,641 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 09:16:23,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1969 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2421, Invalid=8499, Unknown=0, NotChecked=0, Total=10920 [2022-04-28 09:16:23,642 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:23,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 38 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 09:16:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 09:16:23,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-28 09:16:23,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:23,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 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 09:16:23,889 INFO L74 IsIncluded]: Start isIncluded. First operand 69 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 09:16:23,889 INFO L87 Difference]: Start difference. First operand 69 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 09:16:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:23,890 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 09:16:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 09:16:23,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:23,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:23,890 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 69 states. [2022-04-28 09:16:23,890 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 69 states. [2022-04-28 09:16:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:23,891 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 09:16:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 09:16:23,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:23,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:23,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:23,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:23,891 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 09:16:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2022-04-28 09:16:23,892 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2022-04-28 09:16:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:23,892 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2022-04-28 09:16:23,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 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 09:16:23,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 68 transitions. [2022-04-28 09:16:23,978 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 09:16:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 09:16:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 09:16:23,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:23,978 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:23,984 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 09:16:24,179 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,SelfDestructingSolverStorable36 [2022-04-28 09:16:24,179 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:24,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:24,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1569840660, now seen corresponding path program 55 times [2022-04-28 09:16:24,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:24,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1286641423] [2022-04-28 09:16:24,182 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:24,182 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1569840660, now seen corresponding path program 56 times [2022-04-28 09:16:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:24,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595414792] [2022-04-28 09:16:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:24,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:24,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:24,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {17790#(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(14, 2);call #Ultimate.allocInit(12, 3); {17756#true} is VALID [2022-04-28 09:16:24,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {17756#true} assume true; {17756#true} is VALID [2022-04-28 09:16:24,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17756#true} {17756#true} #42#return; {17756#true} is VALID [2022-04-28 09:16:24,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {17756#true} call ULTIMATE.init(); {17790#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:24,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {17790#(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(14, 2);call #Ultimate.allocInit(12, 3); {17756#true} is VALID [2022-04-28 09:16:24,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {17756#true} assume true; {17756#true} is VALID [2022-04-28 09:16:24,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17756#true} {17756#true} #42#return; {17756#true} is VALID [2022-04-28 09:16:24,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {17756#true} call #t~ret6 := main(); {17756#true} is VALID [2022-04-28 09:16:24,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {17756#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {17761#(= main_~x~0 0)} is VALID [2022-04-28 09:16:24,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {17761#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {17761#(= main_~x~0 0)} is VALID [2022-04-28 09:16:24,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {17761#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17762#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:24,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {17762#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {17762#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:24,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {17762#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17763#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:24,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {17763#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17763#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:24,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {17763#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17764#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:24,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {17764#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {17764#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:24,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {17764#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17765#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:24,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {17765#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17765#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:24,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {17765#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17766#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:24,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {17766#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17766#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:24,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {17766#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17767#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:24,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {17767#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17767#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:24,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {17767#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17768#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:24,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {17768#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {17768#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:24,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {17768#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17769#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:24,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {17769#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17769#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:24,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {17769#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17770#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:24,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {17770#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17770#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:24,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {17770#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17771#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:24,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {17771#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17771#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:24,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {17771#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17772#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:24,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {17772#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {17772#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:24,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {17772#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17773#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:24,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {17773#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17773#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:24,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {17773#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17774#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:24,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {17774#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17774#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:24,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {17774#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:24,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {17775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {17775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:24,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {17775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17776#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:24,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {17776#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {17776#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:24,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {17776#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17777#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:24,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {17777#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17777#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:24,754 INFO L290 TraceCheckUtils]: 39: Hoare triple {17777#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17778#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:24,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {17778#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17778#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:24,755 INFO L290 TraceCheckUtils]: 41: Hoare triple {17778#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17779#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:24,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {17779#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17779#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:24,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {17779#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17780#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:24,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {17780#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17780#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:24,756 INFO L290 TraceCheckUtils]: 45: Hoare triple {17780#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17781#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:24,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {17781#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17781#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:24,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {17781#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17782#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:24,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {17782#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17782#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:24,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {17782#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17783#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:24,758 INFO L290 TraceCheckUtils]: 50: Hoare triple {17783#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {17783#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:24,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {17783#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17784#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:24,759 INFO L290 TraceCheckUtils]: 52: Hoare triple {17784#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {17784#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:24,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {17784#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17785#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:24,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {17785#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17785#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:24,761 INFO L290 TraceCheckUtils]: 55: Hoare triple {17785#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17786#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:24,761 INFO L290 TraceCheckUtils]: 56: Hoare triple {17786#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17786#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:24,761 INFO L290 TraceCheckUtils]: 57: Hoare triple {17786#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17787#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:24,762 INFO L290 TraceCheckUtils]: 58: Hoare triple {17787#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17787#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:24,762 INFO L290 TraceCheckUtils]: 59: Hoare triple {17787#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17788#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:24,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {17788#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17788#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:24,763 INFO L290 TraceCheckUtils]: 61: Hoare triple {17788#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17789#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 56))} is VALID [2022-04-28 09:16:24,763 INFO L290 TraceCheckUtils]: 62: Hoare triple {17789#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 56))} assume !(~x~0 % 4294967296 < 99); {17757#false} is VALID [2022-04-28 09:16:24,764 INFO L272 TraceCheckUtils]: 63: Hoare triple {17757#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17757#false} is VALID [2022-04-28 09:16:24,764 INFO L290 TraceCheckUtils]: 64: Hoare triple {17757#false} ~cond := #in~cond; {17757#false} is VALID [2022-04-28 09:16:24,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {17757#false} assume 0 == ~cond; {17757#false} is VALID [2022-04-28 09:16:24,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {17757#false} assume !false; {17757#false} is VALID [2022-04-28 09:16:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:24,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595414792] [2022-04-28 09:16:24,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595414792] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:24,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948336265] [2022-04-28 09:16:24,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:16:24,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:24,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:24,776 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 09:16:24,836 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 09:16:24,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:16:24,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:24,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 09:16:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:24,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:25,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {17756#true} call ULTIMATE.init(); {17756#true} is VALID [2022-04-28 09:16:25,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {17756#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(14, 2);call #Ultimate.allocInit(12, 3); {17756#true} is VALID [2022-04-28 09:16:25,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {17756#true} assume true; {17756#true} is VALID [2022-04-28 09:16:25,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17756#true} {17756#true} #42#return; {17756#true} is VALID [2022-04-28 09:16:25,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {17756#true} call #t~ret6 := main(); {17756#true} is VALID [2022-04-28 09:16:25,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {17756#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {17761#(= main_~x~0 0)} is VALID [2022-04-28 09:16:25,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {17761#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {17761#(= main_~x~0 0)} is VALID [2022-04-28 09:16:25,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {17761#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17762#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:25,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {17762#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {17762#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:25,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {17762#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17763#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:25,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {17763#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17763#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:25,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {17763#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17764#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:25,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {17764#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {17764#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:25,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {17764#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17765#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:25,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {17765#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17765#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:25,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {17765#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17766#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:25,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {17766#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17766#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:25,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {17766#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17767#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:25,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {17767#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17767#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:25,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {17767#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17768#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:25,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {17768#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {17768#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:25,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {17768#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17769#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:25,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {17769#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17769#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:25,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {17769#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17770#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:25,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {17770#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17770#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:25,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {17770#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17771#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:25,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {17771#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17771#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:25,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {17771#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17772#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:25,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {17772#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {17772#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:25,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {17772#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17773#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:25,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {17773#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17773#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:25,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {17773#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17774#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:25,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {17774#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17774#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:25,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {17774#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:25,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {17775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {17775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:25,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {17775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17776#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:25,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {17776#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {17776#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:25,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {17776#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17777#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:25,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {17777#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17777#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:25,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {17777#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17778#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:25,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {17778#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17778#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:25,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {17778#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17779#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:25,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {17779#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17779#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:25,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {17779#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17780#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:25,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {17780#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17780#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:25,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {17780#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17781#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:25,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {17781#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17781#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:25,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {17781#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17782#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:25,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {17782#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17782#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:25,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {17782#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17783#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:25,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {17783#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {17783#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:25,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {17783#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17784#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:25,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {17784#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {17784#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:25,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {17784#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17785#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:25,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {17785#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17785#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:25,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {17785#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17786#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:25,504 INFO L290 TraceCheckUtils]: 56: Hoare triple {17786#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17786#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:25,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {17786#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17787#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:25,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {17787#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17787#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:25,506 INFO L290 TraceCheckUtils]: 59: Hoare triple {17787#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17788#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:25,506 INFO L290 TraceCheckUtils]: 60: Hoare triple {17788#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17788#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:25,506 INFO L290 TraceCheckUtils]: 61: Hoare triple {17788#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {17977#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:25,507 INFO L290 TraceCheckUtils]: 62: Hoare triple {17977#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {17757#false} is VALID [2022-04-28 09:16:25,507 INFO L272 TraceCheckUtils]: 63: Hoare triple {17757#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17757#false} is VALID [2022-04-28 09:16:25,507 INFO L290 TraceCheckUtils]: 64: Hoare triple {17757#false} ~cond := #in~cond; {17757#false} is VALID [2022-04-28 09:16:25,507 INFO L290 TraceCheckUtils]: 65: Hoare triple {17757#false} assume 0 == ~cond; {17757#false} is VALID [2022-04-28 09:16:25,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {17757#false} assume !false; {17757#false} is VALID [2022-04-28 09:16:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:25,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:26,682 INFO L290 TraceCheckUtils]: 66: Hoare triple {17757#false} assume !false; {17757#false} is VALID [2022-04-28 09:16:26,682 INFO L290 TraceCheckUtils]: 65: Hoare triple {17757#false} assume 0 == ~cond; {17757#false} is VALID [2022-04-28 09:16:26,682 INFO L290 TraceCheckUtils]: 64: Hoare triple {17757#false} ~cond := #in~cond; {17757#false} is VALID [2022-04-28 09:16:26,682 INFO L272 TraceCheckUtils]: 63: Hoare triple {17757#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17757#false} is VALID [2022-04-28 09:16:26,683 INFO L290 TraceCheckUtils]: 62: Hoare triple {18005#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {17757#false} is VALID [2022-04-28 09:16:26,683 INFO L290 TraceCheckUtils]: 61: Hoare triple {18009#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18005#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:16:26,683 INFO L290 TraceCheckUtils]: 60: Hoare triple {18009#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18009#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:16:26,684 INFO L290 TraceCheckUtils]: 59: Hoare triple {18016#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18009#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:16:26,684 INFO L290 TraceCheckUtils]: 58: Hoare triple {18016#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18016#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:16:26,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {18023#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18016#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:16:26,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {18023#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18023#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:16:26,685 INFO L290 TraceCheckUtils]: 55: Hoare triple {18030#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18023#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:16:26,685 INFO L290 TraceCheckUtils]: 54: Hoare triple {18030#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18030#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:16:26,686 INFO L290 TraceCheckUtils]: 53: Hoare triple {18037#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18030#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:16:26,686 INFO L290 TraceCheckUtils]: 52: Hoare triple {18037#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18037#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:16:26,687 INFO L290 TraceCheckUtils]: 51: Hoare triple {18044#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18037#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:16:26,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {18044#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18044#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:16:26,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {18051#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18044#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:16:26,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {18051#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18051#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:16:26,688 INFO L290 TraceCheckUtils]: 47: Hoare triple {18058#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18051#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:16:26,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {18058#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18058#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:16:26,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {18065#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18058#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:16:26,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {18065#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18065#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:16:26,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {18072#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18065#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:16:26,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {18072#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18072#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:16:26,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {18079#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18072#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:16:26,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {18079#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18079#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:16:26,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {18086#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18079#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:16:26,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {18086#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18086#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:16:26,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {18093#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18086#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:16:26,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {18093#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18093#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:16:26,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {18100#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18093#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:16:26,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {18100#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18100#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-28 09:16:26,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {18107#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18100#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-28 09:16:26,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {18107#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18107#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:16:26,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {18114#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18107#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:16:26,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {18114#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18114#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:16:26,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {18121#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18114#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:16:26,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {18121#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18121#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-28 09:16:26,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {18128#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18121#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-28 09:16:26,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {18128#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18128#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-28 09:16:26,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {18135#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18128#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-28 09:16:26,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {18135#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18135#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-28 09:16:26,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {18142#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18135#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-28 09:16:26,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {18142#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18142#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:16:26,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {18149#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18142#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:16:26,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {18149#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18149#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:16:26,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {18156#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18149#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:16:26,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {18156#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18156#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:16:26,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {18163#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18156#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:16:26,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {18163#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18163#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-28 09:16:26,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {18170#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18163#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-28 09:16:26,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {18170#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18170#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-28 09:16:26,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {18177#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18170#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-28 09:16:26,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {18177#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18177#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-28 09:16:26,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {18184#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18177#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-28 09:16:26,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {18184#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18184#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-28 09:16:26,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {18191#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18184#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-28 09:16:26,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {18191#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18191#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-28 09:16:26,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {18198#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18191#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-28 09:16:26,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {18198#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {18198#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:16:26,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {17756#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {18198#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:16:26,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {17756#true} call #t~ret6 := main(); {17756#true} is VALID [2022-04-28 09:16:26,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17756#true} {17756#true} #42#return; {17756#true} is VALID [2022-04-28 09:16:26,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {17756#true} assume true; {17756#true} is VALID [2022-04-28 09:16:26,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {17756#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(14, 2);call #Ultimate.allocInit(12, 3); {17756#true} is VALID [2022-04-28 09:16:26,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {17756#true} call ULTIMATE.init(); {17756#true} is VALID [2022-04-28 09:16:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:26,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948336265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:26,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:26,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-28 09:16:26,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:26,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1286641423] [2022-04-28 09:16:26,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1286641423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:26,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:26,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 09:16:26,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149937800] [2022-04-28 09:16:26,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:26,716 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 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 09:16:26,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:26,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 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 09:16:26,745 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 09:16:26,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 09:16:26,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:26,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 09:16:26,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=985, Invalid=2797, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 09:16:26,746 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 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 09:16:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:29,031 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 09:16:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 09:16:29,031 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 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 09:16:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 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 09:16:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 76 transitions. [2022-04-28 09:16:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 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 09:16:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 76 transitions. [2022-04-28 09:16:29,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 76 transitions. [2022-04-28 09:16:29,095 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 09:16:29,096 INFO L225 Difference]: With dead ends: 76 [2022-04-28 09:16:29,096 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 09:16:29,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1970, Invalid=6220, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 09:16:29,097 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:29,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 88 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 09:16:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 09:16:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-04-28 09:16:29,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:29,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 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 09:16:29,404 INFO L74 IsIncluded]: Start isIncluded. First operand 71 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 09:16:29,404 INFO L87 Difference]: Start difference. First operand 71 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 09:16:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:29,404 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 09:16:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 09:16:29,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:29,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:29,405 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 71 states. [2022-04-28 09:16:29,405 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 71 states. [2022-04-28 09:16:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:29,406 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 09:16:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 09:16:29,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:29,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:29,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:29,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:29,407 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 09:16:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2022-04-28 09:16:29,408 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2022-04-28 09:16:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:29,408 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2022-04-28 09:16:29,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 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 09:16:29,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 70 transitions. [2022-04-28 09:16:29,505 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 09:16:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 09:16:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 09:16:29,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:29,506 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:29,535 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 09:16:29,706 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,SelfDestructingSolverStorable37 [2022-04-28 09:16:29,706 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:29,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:29,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2125319569, now seen corresponding path program 57 times [2022-04-28 09:16:29,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:29,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [469919807] [2022-04-28 09:16:29,709 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:29,709 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2125319569, now seen corresponding path program 58 times [2022-04-28 09:16:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:29,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844814273] [2022-04-28 09:16:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:29,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:30,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:30,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {18749#(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(14, 2);call #Ultimate.allocInit(12, 3); {18714#true} is VALID [2022-04-28 09:16:30,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {18714#true} assume true; {18714#true} is VALID [2022-04-28 09:16:30,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18714#true} {18714#true} #42#return; {18714#true} is VALID [2022-04-28 09:16:30,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {18714#true} call ULTIMATE.init(); {18749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:30,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {18749#(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(14, 2);call #Ultimate.allocInit(12, 3); {18714#true} is VALID [2022-04-28 09:16:30,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {18714#true} assume true; {18714#true} is VALID [2022-04-28 09:16:30,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18714#true} {18714#true} #42#return; {18714#true} is VALID [2022-04-28 09:16:30,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {18714#true} call #t~ret6 := main(); {18714#true} is VALID [2022-04-28 09:16:30,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {18714#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {18719#(= main_~x~0 0)} is VALID [2022-04-28 09:16:30,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {18719#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {18719#(= main_~x~0 0)} is VALID [2022-04-28 09:16:30,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {18719#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18720#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:30,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {18720#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {18720#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:30,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {18720#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18721#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:30,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {18721#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18721#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:30,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {18721#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18722#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:30,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {18722#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {18722#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:30,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {18722#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18723#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:30,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {18723#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18723#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:30,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {18723#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18724#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:30,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {18724#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18724#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:30,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {18724#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18725#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:30,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {18725#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18725#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:30,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {18725#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18726#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:30,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {18726#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {18726#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:30,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {18726#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18727#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:30,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {18727#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18727#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:30,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {18727#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18728#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:30,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {18728#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18728#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:30,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {18728#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18729#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:30,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {18729#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18729#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:30,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {18729#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18730#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:30,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {18730#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {18730#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:30,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {18730#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18731#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:30,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {18731#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18731#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:30,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {18731#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18732#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:30,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {18732#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18732#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:30,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {18732#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18733#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:30,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {18733#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {18733#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:30,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {18733#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18734#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:30,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {18734#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {18734#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:30,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {18734#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18735#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:30,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {18735#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18735#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:30,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {18735#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18736#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:30,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {18736#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18736#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:30,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {18736#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18737#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:30,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {18737#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18737#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:30,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {18737#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18738#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:30,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {18738#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18738#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:30,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {18738#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18739#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:30,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {18739#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18739#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:30,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {18739#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18740#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:30,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {18740#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18740#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:30,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {18740#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18741#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:30,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {18741#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {18741#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:30,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {18741#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18742#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:30,133 INFO L290 TraceCheckUtils]: 52: Hoare triple {18742#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {18742#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:30,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {18742#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18743#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:30,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {18743#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18743#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:30,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {18743#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18744#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:30,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {18744#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18744#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:30,135 INFO L290 TraceCheckUtils]: 57: Hoare triple {18744#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18745#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:30,135 INFO L290 TraceCheckUtils]: 58: Hoare triple {18745#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18745#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:30,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {18745#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18746#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:30,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {18746#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18746#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:30,136 INFO L290 TraceCheckUtils]: 61: Hoare triple {18746#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18747#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:30,136 INFO L290 TraceCheckUtils]: 62: Hoare triple {18747#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18747#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:30,137 INFO L290 TraceCheckUtils]: 63: Hoare triple {18747#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18748#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:30,137 INFO L290 TraceCheckUtils]: 64: Hoare triple {18748#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 58))} assume !(~x~0 % 4294967296 < 99); {18715#false} is VALID [2022-04-28 09:16:30,137 INFO L272 TraceCheckUtils]: 65: Hoare triple {18715#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18715#false} is VALID [2022-04-28 09:16:30,137 INFO L290 TraceCheckUtils]: 66: Hoare triple {18715#false} ~cond := #in~cond; {18715#false} is VALID [2022-04-28 09:16:30,138 INFO L290 TraceCheckUtils]: 67: Hoare triple {18715#false} assume 0 == ~cond; {18715#false} is VALID [2022-04-28 09:16:30,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {18715#false} assume !false; {18715#false} is VALID [2022-04-28 09:16:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:30,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:30,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844814273] [2022-04-28 09:16:30,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844814273] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:30,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252004099] [2022-04-28 09:16:30,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:16:30,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:30,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:30,139 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 09:16:30,140 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 09:16:30,172 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:16:30,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:30,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 09:16:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:30,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:31,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {18714#true} call ULTIMATE.init(); {18714#true} is VALID [2022-04-28 09:16:31,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {18714#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(14, 2);call #Ultimate.allocInit(12, 3); {18714#true} is VALID [2022-04-28 09:16:31,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {18714#true} assume true; {18714#true} is VALID [2022-04-28 09:16:31,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18714#true} {18714#true} #42#return; {18714#true} is VALID [2022-04-28 09:16:31,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {18714#true} call #t~ret6 := main(); {18714#true} is VALID [2022-04-28 09:16:31,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {18714#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {18719#(= main_~x~0 0)} is VALID [2022-04-28 09:16:31,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {18719#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {18719#(= main_~x~0 0)} is VALID [2022-04-28 09:16:31,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {18719#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18774#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {18774#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18774#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {18774#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18781#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:16:31,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {18781#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume !!(~x~0 % 4294967296 < 99); {18781#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:16:31,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {18781#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18788#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:16:31,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {18788#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {18788#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:16:31,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {18788#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18795#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {18795#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18795#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {18795#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18802#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:16:31,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {18802#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < 99); {18802#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:16:31,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {18802#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18809#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {18809#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18809#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {18809#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18816#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {18816#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18816#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {18816#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18823#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-28 09:16:31,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {18823#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume !!(~x~0 % 4294967296 < 99); {18823#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-28 09:16:31,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {18823#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18830#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {18830#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18830#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {18830#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18837#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {18837#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18837#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {18837#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18844#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {18844#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18844#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {18844#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18851#(and (= (+ main_~x~0 (- 4)) 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {18851#(and (= (+ main_~x~0 (- 4)) 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18851#(and (= (+ main_~x~0 (- 4)) 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {18851#(and (= (+ main_~x~0 (- 4)) 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18858#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:16:31,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {18858#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 99); {18858#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:16:31,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {18858#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18865#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {18865#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18865#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {18865#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18872#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:16:31,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {18872#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18872#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:16:31,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {18872#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18879#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:31,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {18879#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {18879#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:31,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {18879#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18886#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:16:31,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {18886#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {18886#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:16:31,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {18886#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18893#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {18893#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18893#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {18893#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18900#(and (= 34 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {18900#(and (= 34 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18900#(and (= 34 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {18900#(and (= 34 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18907#(and (= 34 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {18907#(and (= 34 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18907#(and (= 34 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {18907#(and (= 34 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18914#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 34))} is VALID [2022-04-28 09:16:31,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {18914#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 34))} assume !!(~x~0 % 4294967296 < 99); {18914#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 34))} is VALID [2022-04-28 09:16:31,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {18914#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18921#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {18921#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18921#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,407 INFO L290 TraceCheckUtils]: 51: Hoare triple {18921#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18928#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:16:31,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {18928#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {18928#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:16:31,408 INFO L290 TraceCheckUtils]: 53: Hoare triple {18928#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18935#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:31,408 INFO L290 TraceCheckUtils]: 54: Hoare triple {18935#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {18935#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:31,408 INFO L290 TraceCheckUtils]: 55: Hoare triple {18935#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18942#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,409 INFO L290 TraceCheckUtils]: 56: Hoare triple {18942#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18942#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {18942#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18949#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,410 INFO L290 TraceCheckUtils]: 58: Hoare triple {18949#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18949#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,410 INFO L290 TraceCheckUtils]: 59: Hoare triple {18949#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18956#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,410 INFO L290 TraceCheckUtils]: 60: Hoare triple {18956#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18956#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,411 INFO L290 TraceCheckUtils]: 61: Hoare triple {18956#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18963#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,411 INFO L290 TraceCheckUtils]: 62: Hoare triple {18963#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {18963#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,412 INFO L290 TraceCheckUtils]: 63: Hoare triple {18963#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18970#(and (= (+ main_~x~0 (- 4)) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,412 INFO L290 TraceCheckUtils]: 64: Hoare triple {18970#(and (= (+ main_~x~0 (- 4)) 54) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {18970#(and (= (+ main_~x~0 (- 4)) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:31,413 INFO L272 TraceCheckUtils]: 65: Hoare triple {18970#(and (= (+ main_~x~0 (- 4)) 54) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:31,413 INFO L290 TraceCheckUtils]: 66: Hoare triple {18977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:31,413 INFO L290 TraceCheckUtils]: 67: Hoare triple {18981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18715#false} is VALID [2022-04-28 09:16:31,413 INFO L290 TraceCheckUtils]: 68: Hoare triple {18715#false} assume !false; {18715#false} is VALID [2022-04-28 09:16:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:31,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:31,897 INFO L290 TraceCheckUtils]: 68: Hoare triple {18715#false} assume !false; {18715#false} is VALID [2022-04-28 09:16:31,897 INFO L290 TraceCheckUtils]: 67: Hoare triple {18981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18715#false} is VALID [2022-04-28 09:16:31,898 INFO L290 TraceCheckUtils]: 66: Hoare triple {18977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:31,899 INFO L272 TraceCheckUtils]: 65: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:31,899 INFO L290 TraceCheckUtils]: 64: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,900 INFO L290 TraceCheckUtils]: 63: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,900 INFO L290 TraceCheckUtils]: 62: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,901 INFO L290 TraceCheckUtils]: 61: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,901 INFO L290 TraceCheckUtils]: 60: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,901 INFO L290 TraceCheckUtils]: 59: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,902 INFO L290 TraceCheckUtils]: 58: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,903 INFO L290 TraceCheckUtils]: 55: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,904 INFO L290 TraceCheckUtils]: 53: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,904 INFO L290 TraceCheckUtils]: 52: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,904 INFO L290 TraceCheckUtils]: 51: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,905 INFO L290 TraceCheckUtils]: 49: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,907 INFO L290 TraceCheckUtils]: 45: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {19172#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {18997#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:31,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {19172#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {19172#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:31,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {18714#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {19172#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:31,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {18714#true} call #t~ret6 := main(); {18714#true} is VALID [2022-04-28 09:16:31,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18714#true} {18714#true} #42#return; {18714#true} is VALID [2022-04-28 09:16:31,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {18714#true} assume true; {18714#true} is VALID [2022-04-28 09:16:31,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {18714#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(14, 2);call #Ultimate.allocInit(12, 3); {18714#true} is VALID [2022-04-28 09:16:31,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {18714#true} call ULTIMATE.init(); {18714#true} is VALID [2022-04-28 09:16:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-28 09:16:31,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252004099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:31,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:31,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 6] total 66 [2022-04-28 09:16:31,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:31,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [469919807] [2022-04-28 09:16:31,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [469919807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:31,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:31,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 09:16:31,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468040044] [2022-04-28 09:16:31,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:31,924 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 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 09:16:31,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:31,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 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 09:16:31,960 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 09:16:31,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 09:16:31,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:31,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 09:16:31,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=3988, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 09:16:31,961 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 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 09:16:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:34,157 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 09:16:34,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 09:16:34,158 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 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 09:16:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 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 09:16:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 78 transitions. [2022-04-28 09:16:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 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 09:16:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 78 transitions. [2022-04-28 09:16:34,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 78 transitions. [2022-04-28 09:16:34,252 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 09:16:34,253 INFO L225 Difference]: With dead ends: 78 [2022-04-28 09:16:34,253 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 09:16:34,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1888 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=509, Invalid=8611, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 09:16:34,257 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:34,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 48 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 09:16:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 09:16:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2022-04-28 09:16:34,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:34,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 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 09:16:34,527 INFO L74 IsIncluded]: Start isIncluded. First operand 73 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 09:16:34,527 INFO L87 Difference]: Start difference. First operand 73 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 09:16:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:34,528 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-28 09:16:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 09:16:34,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:34,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:34,528 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 73 states. [2022-04-28 09:16:34,529 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 73 states. [2022-04-28 09:16:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:34,530 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-28 09:16:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 09:16:34,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:34,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:34,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:34,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:34,530 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 09:16:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2022-04-28 09:16:34,531 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2022-04-28 09:16:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:34,531 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2022-04-28 09:16:34,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 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 09:16:34,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 72 transitions. [2022-04-28 09:16:34,641 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 09:16:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 09:16:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 09:16:34,641 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:34,641 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:34,659 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 09:16:34,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 09:16:34,855 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:34,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:34,855 INFO L85 PathProgramCache]: Analyzing trace with hash -930360882, now seen corresponding path program 59 times [2022-04-28 09:16:34,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:34,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1029217659] [2022-04-28 09:16:34,858 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:34,858 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash -930360882, now seen corresponding path program 60 times [2022-04-28 09:16:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:34,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132194175] [2022-04-28 09:16:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:35,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:35,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {19738#(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(14, 2);call #Ultimate.allocInit(12, 3); {19702#true} is VALID [2022-04-28 09:16:35,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {19702#true} assume true; {19702#true} is VALID [2022-04-28 09:16:35,503 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19702#true} {19702#true} #42#return; {19702#true} is VALID [2022-04-28 09:16:35,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {19702#true} call ULTIMATE.init(); {19738#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:35,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {19738#(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(14, 2);call #Ultimate.allocInit(12, 3); {19702#true} is VALID [2022-04-28 09:16:35,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {19702#true} assume true; {19702#true} is VALID [2022-04-28 09:16:35,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19702#true} {19702#true} #42#return; {19702#true} is VALID [2022-04-28 09:16:35,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {19702#true} call #t~ret6 := main(); {19702#true} is VALID [2022-04-28 09:16:35,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {19702#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {19707#(= main_~x~0 0)} is VALID [2022-04-28 09:16:35,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {19707#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {19707#(= main_~x~0 0)} is VALID [2022-04-28 09:16:35,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {19707#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:35,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {19708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {19708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:35,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {19708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19709#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:35,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {19709#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19709#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:35,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {19709#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19710#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:35,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {19710#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {19710#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:35,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {19710#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19711#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:35,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {19711#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19711#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:35,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {19711#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19712#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:35,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {19712#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19712#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:35,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {19712#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19713#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:35,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {19713#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19713#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:35,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {19713#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19714#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:35,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {19714#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {19714#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:35,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {19714#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19715#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:35,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {19715#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19715#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:35,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {19715#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19716#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:35,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {19716#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19716#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:35,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {19716#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19717#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:35,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {19717#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19717#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:35,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {19717#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19718#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:35,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {19718#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {19718#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:35,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {19718#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19719#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:35,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {19719#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19719#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:35,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {19719#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19720#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:35,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {19720#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19720#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:35,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {19720#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19721#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:35,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {19721#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {19721#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:35,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {19721#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19722#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:35,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {19722#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {19722#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:35,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {19722#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19723#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:35,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {19723#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19723#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:35,517 INFO L290 TraceCheckUtils]: 39: Hoare triple {19723#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19724#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:35,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {19724#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19724#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:35,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {19724#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19725#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:35,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {19725#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19725#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:35,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {19725#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19726#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:35,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {19726#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19726#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:35,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {19726#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19727#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:35,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {19727#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19727#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:35,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {19727#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19728#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:35,520 INFO L290 TraceCheckUtils]: 48: Hoare triple {19728#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19728#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:35,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {19728#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19729#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:35,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {19729#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {19729#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:35,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {19729#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19730#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:35,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {19730#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {19730#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:35,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {19730#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19731#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:35,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {19731#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19731#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:35,523 INFO L290 TraceCheckUtils]: 55: Hoare triple {19731#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19732#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:35,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {19732#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19732#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:35,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {19732#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19733#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:35,524 INFO L290 TraceCheckUtils]: 58: Hoare triple {19733#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19733#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:35,525 INFO L290 TraceCheckUtils]: 59: Hoare triple {19733#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19734#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:35,525 INFO L290 TraceCheckUtils]: 60: Hoare triple {19734#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19734#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:35,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {19734#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19735#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:35,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {19735#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19735#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:35,526 INFO L290 TraceCheckUtils]: 63: Hoare triple {19735#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19736#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:35,526 INFO L290 TraceCheckUtils]: 64: Hoare triple {19736#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {19736#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:35,527 INFO L290 TraceCheckUtils]: 65: Hoare triple {19736#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19737#(and (<= main_~x~0 60) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:16:35,527 INFO L290 TraceCheckUtils]: 66: Hoare triple {19737#(and (<= main_~x~0 60) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {19703#false} is VALID [2022-04-28 09:16:35,528 INFO L272 TraceCheckUtils]: 67: Hoare triple {19703#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19703#false} is VALID [2022-04-28 09:16:35,528 INFO L290 TraceCheckUtils]: 68: Hoare triple {19703#false} ~cond := #in~cond; {19703#false} is VALID [2022-04-28 09:16:35,528 INFO L290 TraceCheckUtils]: 69: Hoare triple {19703#false} assume 0 == ~cond; {19703#false} is VALID [2022-04-28 09:16:35,528 INFO L290 TraceCheckUtils]: 70: Hoare triple {19703#false} assume !false; {19703#false} is VALID [2022-04-28 09:16:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:35,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132194175] [2022-04-28 09:16:35,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132194175] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:35,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495259447] [2022-04-28 09:16:35,528 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:16:35,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:35,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:35,529 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 09:16:35,530 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 09:16:37,925 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-28 09:16:37,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:37,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-28 09:16:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:37,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:39,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {19702#true} call ULTIMATE.init(); {19702#true} is VALID [2022-04-28 09:16:39,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {19702#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(14, 2);call #Ultimate.allocInit(12, 3); {19702#true} is VALID [2022-04-28 09:16:39,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {19702#true} assume true; {19702#true} is VALID [2022-04-28 09:16:39,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19702#true} {19702#true} #42#return; {19702#true} is VALID [2022-04-28 09:16:39,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {19702#true} call #t~ret6 := main(); {19702#true} is VALID [2022-04-28 09:16:39,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {19702#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {19707#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {19707#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {19707#(= main_~x~0 0)} is VALID [2022-04-28 09:16:39,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {19707#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:39,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {19708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {19708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:39,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {19708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19709#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:39,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {19709#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19709#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:39,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {19709#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19710#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:39,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {19710#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {19710#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:39,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {19710#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19711#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:39,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {19711#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19711#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:39,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {19711#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19712#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:39,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {19712#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19712#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:39,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {19712#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19713#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:39,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {19713#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19713#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:39,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {19713#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19714#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:39,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {19714#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {19714#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:39,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {19714#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19715#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:39,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {19715#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19715#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:39,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {19715#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19716#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:39,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {19716#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19716#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:39,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {19716#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19717#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:39,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {19717#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19717#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:39,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {19717#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19718#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:39,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {19718#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {19718#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:39,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {19718#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19719#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:39,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {19719#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19719#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:39,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {19719#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19720#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:39,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {19720#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19720#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:39,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {19720#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19721#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:39,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {19721#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {19721#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:39,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {19721#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19847#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {19847#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {19847#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {19847#(and (<= 30 main_~x~0) (<= main_~x~0 30) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19854#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:39,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {19854#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19854#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:39,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {19854#(and (<= main_~x~0 32) (<= (mod main_~y~0 2) 0) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19861#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,391 INFO L290 TraceCheckUtils]: 40: Hoare triple {19861#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {19861#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {19861#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19868#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {19868#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {19868#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {19868#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19875#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:39,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {19875#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19875#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:39,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {19875#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19882#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:39,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {19882#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19882#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:39,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {19882#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19889#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {19889#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {19889#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {19889#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19896#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:39,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {19896#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {19896#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:39,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {19896#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19903#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:39,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {19903#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {19903#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:39,395 INFO L290 TraceCheckUtils]: 53: Hoare triple {19903#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19910#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:39,396 INFO L290 TraceCheckUtils]: 54: Hoare triple {19910#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19910#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:39,396 INFO L290 TraceCheckUtils]: 55: Hoare triple {19910#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19917#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,396 INFO L290 TraceCheckUtils]: 56: Hoare triple {19917#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {19917#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,397 INFO L290 TraceCheckUtils]: 57: Hoare triple {19917#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19924#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,397 INFO L290 TraceCheckUtils]: 58: Hoare triple {19924#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {19924#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,397 INFO L290 TraceCheckUtils]: 59: Hoare triple {19924#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19931#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:39,398 INFO L290 TraceCheckUtils]: 60: Hoare triple {19931#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19931#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:39,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {19931#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19938#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:39,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {19938#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19938#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:39,399 INFO L290 TraceCheckUtils]: 63: Hoare triple {19938#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19945#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:39,399 INFO L290 TraceCheckUtils]: 64: Hoare triple {19945#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {19945#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:39,400 INFO L290 TraceCheckUtils]: 65: Hoare triple {19945#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19952#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,400 INFO L290 TraceCheckUtils]: 66: Hoare triple {19952#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {19952#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:39,401 INFO L272 TraceCheckUtils]: 67: Hoare triple {19952#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19959#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:39,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {19959#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19963#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:39,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {19963#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19703#false} is VALID [2022-04-28 09:16:39,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {19703#false} assume !false; {19703#false} is VALID [2022-04-28 09:16:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:39,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:39,816 INFO L290 TraceCheckUtils]: 70: Hoare triple {19703#false} assume !false; {19703#false} is VALID [2022-04-28 09:16:39,817 INFO L290 TraceCheckUtils]: 69: Hoare triple {19963#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19703#false} is VALID [2022-04-28 09:16:39,817 INFO L290 TraceCheckUtils]: 68: Hoare triple {19959#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19963#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:39,817 INFO L272 TraceCheckUtils]: 67: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19959#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:39,818 INFO L290 TraceCheckUtils]: 66: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,818 INFO L290 TraceCheckUtils]: 65: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,818 INFO L290 TraceCheckUtils]: 64: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,819 INFO L290 TraceCheckUtils]: 61: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,820 INFO L290 TraceCheckUtils]: 60: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,820 INFO L290 TraceCheckUtils]: 59: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,822 INFO L290 TraceCheckUtils]: 54: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,824 INFO L290 TraceCheckUtils]: 47: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,824 INFO L290 TraceCheckUtils]: 46: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,825 INFO L290 TraceCheckUtils]: 45: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,826 INFO L290 TraceCheckUtils]: 42: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {19979#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:39,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {20076#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {19702#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {20076#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:39,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {19702#true} call #t~ret6 := main(); {19702#true} is VALID [2022-04-28 09:16:39,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19702#true} {19702#true} #42#return; {19702#true} is VALID [2022-04-28 09:16:39,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {19702#true} assume true; {19702#true} is VALID [2022-04-28 09:16:39,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {19702#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(14, 2);call #Ultimate.allocInit(12, 3); {19702#true} is VALID [2022-04-28 09:16:39,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {19702#true} call ULTIMATE.init(); {19702#true} is VALID [2022-04-28 09:16:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-28 09:16:39,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495259447] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:39,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:39,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 6] total 54 [2022-04-28 09:16:39,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:39,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1029217659] [2022-04-28 09:16:39,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1029217659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:39,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:39,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 09:16:39,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691002201] [2022-04-28 09:16:39,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:39,839 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 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 09:16:39,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:39,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 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 09:16:39,881 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 09:16:39,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 09:16:39,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:39,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 09:16:39,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2634, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 09:16:39,882 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 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 09:16:42,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:42,690 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 09:16:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 09:16:42,691 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 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 09:16:42,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 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 09:16:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 80 transitions. [2022-04-28 09:16:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 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 09:16:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 80 transitions. [2022-04-28 09:16:42,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 80 transitions. [2022-04-28 09:16:42,735 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 09:16:42,735 INFO L225 Difference]: With dead ends: 80 [2022-04-28 09:16:42,736 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 09:16:42,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=442, Invalid=6698, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 09:16:42,736 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:42,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 78 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1898 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 09:16:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 09:16:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-04-28 09:16:42,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:42,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 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 09:16:42,938 INFO L74 IsIncluded]: Start isIncluded. First operand 75 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 09:16:42,938 INFO L87 Difference]: Start difference. First operand 75 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 09:16:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:42,939 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-28 09:16:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 09:16:42,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:42,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:42,940 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 75 states. [2022-04-28 09:16:42,940 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 75 states. [2022-04-28 09:16:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:42,941 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-28 09:16:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 09:16:42,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:42,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:42,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:42,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:42,941 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 09:16:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2022-04-28 09:16:42,943 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2022-04-28 09:16:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:42,943 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2022-04-28 09:16:42,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 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 09:16:42,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 74 transitions. [2022-04-28 09:16:43,070 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 09:16:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-28 09:16:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 09:16:43,071 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:43,071 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:43,091 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 09:16:43,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 09:16:43,276 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:43,277 INFO L85 PathProgramCache]: Analyzing trace with hash 318356171, now seen corresponding path program 61 times [2022-04-28 09:16:43,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:43,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [117242327] [2022-04-28 09:16:43,279 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:43,279 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:43,279 INFO L85 PathProgramCache]: Analyzing trace with hash 318356171, now seen corresponding path program 62 times [2022-04-28 09:16:43,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:43,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201732821] [2022-04-28 09:16:43,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:43,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:43,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {20741#(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(14, 2);call #Ultimate.allocInit(12, 3); {20704#true} is VALID [2022-04-28 09:16:43,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {20704#true} assume true; {20704#true} is VALID [2022-04-28 09:16:43,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20704#true} {20704#true} #42#return; {20704#true} is VALID [2022-04-28 09:16:43,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {20704#true} call ULTIMATE.init(); {20741#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:43,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {20741#(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(14, 2);call #Ultimate.allocInit(12, 3); {20704#true} is VALID [2022-04-28 09:16:43,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {20704#true} assume true; {20704#true} is VALID [2022-04-28 09:16:43,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20704#true} {20704#true} #42#return; {20704#true} is VALID [2022-04-28 09:16:43,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {20704#true} call #t~ret6 := main(); {20704#true} is VALID [2022-04-28 09:16:43,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {20704#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {20709#(= main_~x~0 0)} is VALID [2022-04-28 09:16:43,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {20709#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {20709#(= main_~x~0 0)} is VALID [2022-04-28 09:16:43,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {20709#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20710#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:43,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {20710#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {20710#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:43,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {20710#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20711#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:43,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {20711#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20711#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:43,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {20711#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20712#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:43,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {20712#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {20712#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:43,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {20712#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20713#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:43,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {20713#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20713#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:43,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {20713#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:43,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {20714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:43,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {20714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20715#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:43,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {20715#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20715#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:43,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {20715#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20716#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:43,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {20716#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {20716#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:43,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {20716#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20717#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:43,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {20717#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20717#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:43,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {20717#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20718#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:43,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {20718#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20718#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:43,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {20718#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20719#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:43,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {20719#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20719#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:43,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {20719#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20720#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:43,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {20720#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {20720#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:43,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {20720#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20721#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:43,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {20721#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20721#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:43,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {20721#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20722#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:43,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {20722#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20722#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:43,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {20722#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20723#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:43,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {20723#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {20723#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:43,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {20723#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20724#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:43,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {20724#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {20724#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:43,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {20724#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20725#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:43,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {20725#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20725#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:43,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {20725#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20726#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:43,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {20726#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20726#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:43,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {20726#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20727#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:43,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {20727#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20727#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:43,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {20727#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20728#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:43,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {20728#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20728#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:43,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {20728#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20729#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:43,874 INFO L290 TraceCheckUtils]: 46: Hoare triple {20729#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20729#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:43,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {20729#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20730#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:43,874 INFO L290 TraceCheckUtils]: 48: Hoare triple {20730#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20730#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:43,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {20730#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20731#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:43,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {20731#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {20731#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:43,875 INFO L290 TraceCheckUtils]: 51: Hoare triple {20731#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20732#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:43,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {20732#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {20732#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:43,876 INFO L290 TraceCheckUtils]: 53: Hoare triple {20732#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20733#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:43,876 INFO L290 TraceCheckUtils]: 54: Hoare triple {20733#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20733#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:43,877 INFO L290 TraceCheckUtils]: 55: Hoare triple {20733#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20734#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:43,877 INFO L290 TraceCheckUtils]: 56: Hoare triple {20734#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20734#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:43,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {20734#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20735#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:43,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {20735#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20735#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:43,878 INFO L290 TraceCheckUtils]: 59: Hoare triple {20735#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20736#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:43,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {20736#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20736#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:43,879 INFO L290 TraceCheckUtils]: 61: Hoare triple {20736#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20737#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:43,879 INFO L290 TraceCheckUtils]: 62: Hoare triple {20737#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20737#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:43,880 INFO L290 TraceCheckUtils]: 63: Hoare triple {20737#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20738#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:43,880 INFO L290 TraceCheckUtils]: 64: Hoare triple {20738#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {20738#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:43,880 INFO L290 TraceCheckUtils]: 65: Hoare triple {20738#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20739#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:16:43,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {20739#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20739#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:16:43,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {20739#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20740#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 62))} is VALID [2022-04-28 09:16:43,881 INFO L290 TraceCheckUtils]: 68: Hoare triple {20740#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 62))} assume !(~x~0 % 4294967296 < 99); {20705#false} is VALID [2022-04-28 09:16:43,881 INFO L272 TraceCheckUtils]: 69: Hoare triple {20705#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {20705#false} is VALID [2022-04-28 09:16:43,881 INFO L290 TraceCheckUtils]: 70: Hoare triple {20705#false} ~cond := #in~cond; {20705#false} is VALID [2022-04-28 09:16:43,882 INFO L290 TraceCheckUtils]: 71: Hoare triple {20705#false} assume 0 == ~cond; {20705#false} is VALID [2022-04-28 09:16:43,882 INFO L290 TraceCheckUtils]: 72: Hoare triple {20705#false} assume !false; {20705#false} is VALID [2022-04-28 09:16:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:43,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:43,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201732821] [2022-04-28 09:16:43,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201732821] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:43,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266127988] [2022-04-28 09:16:43,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:16:43,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:43,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:43,883 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 09:16:43,899 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 09:16:43,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:16:43,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:43,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 09:16:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:43,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:45,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {20704#true} call ULTIMATE.init(); {20704#true} is VALID [2022-04-28 09:16:45,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {20704#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(14, 2);call #Ultimate.allocInit(12, 3); {20704#true} is VALID [2022-04-28 09:16:45,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {20704#true} assume true; {20704#true} is VALID [2022-04-28 09:16:45,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20704#true} {20704#true} #42#return; {20704#true} is VALID [2022-04-28 09:16:45,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {20704#true} call #t~ret6 := main(); {20704#true} is VALID [2022-04-28 09:16:45,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {20704#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {20709#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {20709#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {20709#(= main_~x~0 0)} is VALID [2022-04-28 09:16:45,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {20709#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20766#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {20766#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20766#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {20766#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20773#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:16:45,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {20773#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume !!(~x~0 % 4294967296 < 99); {20773#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:16:45,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {20773#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20780#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:16:45,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {20780#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {20780#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:16:45,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {20780#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20787#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:16:45,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {20787#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {20787#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:16:45,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {20787#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20794#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {20794#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20794#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {20794#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20801#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {20801#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20801#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {20801#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20808#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {20808#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20808#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {20808#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20815#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-28 09:16:45,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {20815#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume !!(~x~0 % 4294967296 < 99); {20815#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-28 09:16:45,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {20815#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20822#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {20822#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20822#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {20822#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20829#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {20829#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20829#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {20829#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20836#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {20836#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20836#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {20836#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20843#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {20843#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20843#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {20843#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20850#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 24))} is VALID [2022-04-28 09:16:45,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {20850#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 24))} assume !!(~x~0 % 4294967296 < 99); {20850#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 24))} is VALID [2022-04-28 09:16:45,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {20850#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 24))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20857#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {20857#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20857#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {20857#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20864#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:16:45,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {20864#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20864#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:16:45,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {20864#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20871#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {20871#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20871#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {20871#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20878#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:16:45,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {20878#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {20878#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:16:45,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {20878#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20885#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:16:45,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {20885#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume !!(~x~0 % 4294967296 < 99); {20885#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:16:45,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {20885#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20892#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,220 INFO L290 TraceCheckUtils]: 44: Hoare triple {20892#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20892#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {20892#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20899#(and (= (+ main_~x~0 (- 4)) 36) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {20899#(and (= (+ main_~x~0 (- 4)) 36) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20899#(and (= (+ main_~x~0 (- 4)) 36) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,221 INFO L290 TraceCheckUtils]: 47: Hoare triple {20899#(and (= (+ main_~x~0 (- 4)) 36) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20906#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:16:45,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {20906#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20906#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:16:45,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {20906#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20913#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:45,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {20913#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {20913#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:16:45,222 INFO L290 TraceCheckUtils]: 51: Hoare triple {20913#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20920#(and (= 42 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {20920#(and (= 42 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20920#(and (= 42 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {20920#(and (= 42 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20927#(and (<= (mod main_~y~0 2) 0) (= 42 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:16:45,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {20927#(and (<= (mod main_~y~0 2) 0) (= 42 (+ main_~x~0 (- 6))))} assume !!(~x~0 % 4294967296 < 99); {20927#(and (<= (mod main_~y~0 2) 0) (= 42 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:16:45,224 INFO L290 TraceCheckUtils]: 55: Hoare triple {20927#(and (<= (mod main_~y~0 2) 0) (= 42 (+ main_~x~0 (- 6))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20934#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,224 INFO L290 TraceCheckUtils]: 56: Hoare triple {20934#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20934#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {20934#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20941#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {20941#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20941#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,225 INFO L290 TraceCheckUtils]: 59: Hoare triple {20941#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20948#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,225 INFO L290 TraceCheckUtils]: 60: Hoare triple {20948#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20948#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,226 INFO L290 TraceCheckUtils]: 61: Hoare triple {20948#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20955#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,226 INFO L290 TraceCheckUtils]: 62: Hoare triple {20955#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20955#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,227 INFO L290 TraceCheckUtils]: 63: Hoare triple {20955#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20962#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,227 INFO L290 TraceCheckUtils]: 64: Hoare triple {20962#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20962#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,227 INFO L290 TraceCheckUtils]: 65: Hoare triple {20962#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20969#(and (= 58 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,228 INFO L290 TraceCheckUtils]: 66: Hoare triple {20969#(and (= 58 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {20969#(and (= 58 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:45,228 INFO L290 TraceCheckUtils]: 67: Hoare triple {20969#(and (= 58 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {20976#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 58))} is VALID [2022-04-28 09:16:45,228 INFO L290 TraceCheckUtils]: 68: Hoare triple {20976#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 58))} assume !(~x~0 % 4294967296 < 99); {20976#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 58))} is VALID [2022-04-28 09:16:45,229 INFO L272 TraceCheckUtils]: 69: Hoare triple {20976#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 58))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {20983#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:45,229 INFO L290 TraceCheckUtils]: 70: Hoare triple {20983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:45,229 INFO L290 TraceCheckUtils]: 71: Hoare triple {20987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20705#false} is VALID [2022-04-28 09:16:45,229 INFO L290 TraceCheckUtils]: 72: Hoare triple {20705#false} assume !false; {20705#false} is VALID [2022-04-28 09:16:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:45,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:45,720 INFO L290 TraceCheckUtils]: 72: Hoare triple {20705#false} assume !false; {20705#false} is VALID [2022-04-28 09:16:45,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {20987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20705#false} is VALID [2022-04-28 09:16:45,721 INFO L290 TraceCheckUtils]: 70: Hoare triple {20983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:45,721 INFO L272 TraceCheckUtils]: 69: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {20983#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:45,721 INFO L290 TraceCheckUtils]: 68: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,722 INFO L290 TraceCheckUtils]: 67: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,722 INFO L290 TraceCheckUtils]: 66: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,723 INFO L290 TraceCheckUtils]: 64: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,724 INFO L290 TraceCheckUtils]: 63: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,724 INFO L290 TraceCheckUtils]: 62: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,727 INFO L290 TraceCheckUtils]: 55: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,727 INFO L290 TraceCheckUtils]: 54: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {21190#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21003#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:45,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {21190#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {21190#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:45,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {20704#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {21190#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:45,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {20704#true} call #t~ret6 := main(); {20704#true} is VALID [2022-04-28 09:16:45,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20704#true} {20704#true} #42#return; {20704#true} is VALID [2022-04-28 09:16:45,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {20704#true} assume true; {20704#true} is VALID [2022-04-28 09:16:45,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {20704#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(14, 2);call #Ultimate.allocInit(12, 3); {20704#true} is VALID [2022-04-28 09:16:45,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {20704#true} call ULTIMATE.init(); {20704#true} is VALID [2022-04-28 09:16:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2022-04-28 09:16:45,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266127988] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:45,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:45,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36, 6] total 70 [2022-04-28 09:16:45,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:45,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [117242327] [2022-04-28 09:16:45,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [117242327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:45,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:45,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 09:16:45,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850803230] [2022-04-28 09:16:45,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:45,748 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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 09:16:45,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:45,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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 09:16:45,799 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 09:16:45,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 09:16:45,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:45,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 09:16:45,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=4508, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 09:16:45,799 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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 09:16:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:49,327 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-28 09:16:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 09:16:49,327 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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 09:16:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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 09:16:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 82 transitions. [2022-04-28 09:16:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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 09:16:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 82 transitions. [2022-04-28 09:16:49,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 82 transitions. [2022-04-28 09:16:49,373 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 09:16:49,374 INFO L225 Difference]: With dead ends: 82 [2022-04-28 09:16:49,374 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 09:16:49,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=543, Invalid=9759, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 09:16:49,375 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2026 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:49,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 83 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2026 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 09:16:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 09:16:49,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2022-04-28 09:16:49,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:49,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 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 09:16:49,556 INFO L74 IsIncluded]: Start isIncluded. First operand 77 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 09:16:49,556 INFO L87 Difference]: Start difference. First operand 77 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 09:16:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:49,557 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-28 09:16:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-28 09:16:49,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:49,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:49,557 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 77 states. [2022-04-28 09:16:49,557 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 77 states. [2022-04-28 09:16:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:49,558 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-28 09:16:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-28 09:16:49,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:49,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:49,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:49,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:49,558 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 09:16:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2022-04-28 09:16:49,559 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2022-04-28 09:16:49,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:49,560 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2022-04-28 09:16:49,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 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 09:16:49,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 76 transitions. [2022-04-28 09:16:49,672 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 09:16:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-28 09:16:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 09:16:49,673 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:49,673 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:49,691 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 09:16:49,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:49,889 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:49,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:49,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2039568520, now seen corresponding path program 63 times [2022-04-28 09:16:49,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:49,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1423705917] [2022-04-28 09:16:49,909 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:49,909 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:49,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2039568520, now seen corresponding path program 64 times [2022-04-28 09:16:49,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:49,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17064843] [2022-04-28 09:16:49,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:49,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:50,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:50,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {21786#(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(14, 2);call #Ultimate.allocInit(12, 3); {21748#true} is VALID [2022-04-28 09:16:50,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {21748#true} assume true; {21748#true} is VALID [2022-04-28 09:16:50,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21748#true} {21748#true} #42#return; {21748#true} is VALID [2022-04-28 09:16:50,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {21748#true} call ULTIMATE.init(); {21786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:50,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {21786#(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(14, 2);call #Ultimate.allocInit(12, 3); {21748#true} is VALID [2022-04-28 09:16:50,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {21748#true} assume true; {21748#true} is VALID [2022-04-28 09:16:50,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21748#true} {21748#true} #42#return; {21748#true} is VALID [2022-04-28 09:16:50,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {21748#true} call #t~ret6 := main(); {21748#true} is VALID [2022-04-28 09:16:50,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {21748#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {21753#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {21753#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {21753#(= main_~x~0 0)} is VALID [2022-04-28 09:16:50,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {21753#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {21754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {21754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:50,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {21754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:50,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {21755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:50,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {21755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:50,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {21756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {21756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:50,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {21756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:50,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {21757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:50,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {21757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:50,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {21758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:50,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {21758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:50,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {21759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:50,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {21759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21760#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:50,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {21760#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {21760#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:50,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {21760#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21761#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:50,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {21761#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21761#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:50,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {21761#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21762#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:50,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {21762#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21762#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:50,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {21762#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21763#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:50,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {21763#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21763#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:50,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {21763#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21764#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:50,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {21764#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {21764#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:50,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {21764#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21765#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:50,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {21765#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21765#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:50,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {21765#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21766#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:50,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {21766#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21766#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:50,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {21766#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21767#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:50,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {21767#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {21767#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:50,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {21767#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21768#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:50,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {21768#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {21768#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:50,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {21768#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21769#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:50,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {21769#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21769#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:50,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {21769#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21770#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:50,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {21770#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21770#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:50,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {21770#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21771#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:50,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {21771#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21771#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:50,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {21771#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21772#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:50,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {21772#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21772#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:50,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {21772#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21773#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:50,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {21773#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21773#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:50,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {21773#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21774#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:50,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {21774#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21774#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:50,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {21774#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21775#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:50,364 INFO L290 TraceCheckUtils]: 50: Hoare triple {21775#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {21775#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:50,365 INFO L290 TraceCheckUtils]: 51: Hoare triple {21775#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21776#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:50,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {21776#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {21776#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:50,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {21776#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21777#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:50,365 INFO L290 TraceCheckUtils]: 54: Hoare triple {21777#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21777#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:50,366 INFO L290 TraceCheckUtils]: 55: Hoare triple {21777#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21778#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:50,366 INFO L290 TraceCheckUtils]: 56: Hoare triple {21778#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21778#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:50,366 INFO L290 TraceCheckUtils]: 57: Hoare triple {21778#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21779#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:50,367 INFO L290 TraceCheckUtils]: 58: Hoare triple {21779#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21779#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:50,367 INFO L290 TraceCheckUtils]: 59: Hoare triple {21779#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21780#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:50,367 INFO L290 TraceCheckUtils]: 60: Hoare triple {21780#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21780#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:50,368 INFO L290 TraceCheckUtils]: 61: Hoare triple {21780#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21781#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:50,368 INFO L290 TraceCheckUtils]: 62: Hoare triple {21781#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21781#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:50,368 INFO L290 TraceCheckUtils]: 63: Hoare triple {21781#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21782#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:50,368 INFO L290 TraceCheckUtils]: 64: Hoare triple {21782#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {21782#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:50,369 INFO L290 TraceCheckUtils]: 65: Hoare triple {21782#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21783#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:16:50,369 INFO L290 TraceCheckUtils]: 66: Hoare triple {21783#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21783#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:16:50,369 INFO L290 TraceCheckUtils]: 67: Hoare triple {21783#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21784#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:16:50,370 INFO L290 TraceCheckUtils]: 68: Hoare triple {21784#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {21784#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:16:50,370 INFO L290 TraceCheckUtils]: 69: Hoare triple {21784#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21785#(and (<= main_~x~0 64) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:16:50,370 INFO L290 TraceCheckUtils]: 70: Hoare triple {21785#(and (<= main_~x~0 64) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {21749#false} is VALID [2022-04-28 09:16:50,370 INFO L272 TraceCheckUtils]: 71: Hoare triple {21749#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21749#false} is VALID [2022-04-28 09:16:50,370 INFO L290 TraceCheckUtils]: 72: Hoare triple {21749#false} ~cond := #in~cond; {21749#false} is VALID [2022-04-28 09:16:50,371 INFO L290 TraceCheckUtils]: 73: Hoare triple {21749#false} assume 0 == ~cond; {21749#false} is VALID [2022-04-28 09:16:50,371 INFO L290 TraceCheckUtils]: 74: Hoare triple {21749#false} assume !false; {21749#false} is VALID [2022-04-28 09:16:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:50,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:50,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17064843] [2022-04-28 09:16:50,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17064843] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:50,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637682761] [2022-04-28 09:16:50,371 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:16:50,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:50,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:50,392 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 09:16:50,407 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 09:16:50,460 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:16:50,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:50,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 70 conjunts are in the unsatisfiable core [2022-04-28 09:16:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:50,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:51,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {21748#true} call ULTIMATE.init(); {21748#true} is VALID [2022-04-28 09:16:51,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {21748#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(14, 2);call #Ultimate.allocInit(12, 3); {21748#true} is VALID [2022-04-28 09:16:51,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {21748#true} assume true; {21748#true} is VALID [2022-04-28 09:16:51,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21748#true} {21748#true} #42#return; {21748#true} is VALID [2022-04-28 09:16:51,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {21748#true} call #t~ret6 := main(); {21748#true} is VALID [2022-04-28 09:16:51,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {21748#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {21753#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {21753#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {21753#(= main_~x~0 0)} is VALID [2022-04-28 09:16:51,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {21753#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {21754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {21754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:51,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {21754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:51,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {21755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:51,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {21755#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:51,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {21756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {21756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:51,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {21756#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:51,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {21757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:51,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {21757#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:51,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {21758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:51,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {21758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:51,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {21759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:51,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {21759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21760#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:51,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {21760#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {21760#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:51,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {21760#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21761#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:51,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {21761#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21761#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:51,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {21761#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21762#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:51,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {21762#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21762#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:51,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {21762#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21763#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:51,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {21763#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21763#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:51,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {21763#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21764#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:51,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {21764#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {21764#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:51,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {21764#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21765#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:51,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {21765#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21765#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:51,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {21765#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21766#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:51,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {21766#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21766#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:51,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {21766#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21767#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:51,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {21767#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {21767#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:51,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {21767#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21768#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:51,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {21768#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {21768#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:51,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {21768#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21769#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:51,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {21769#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21769#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:51,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {21769#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21770#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:51,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {21770#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21770#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:51,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {21770#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21771#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:51,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {21771#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21771#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:51,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {21771#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21772#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:51,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {21772#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21772#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:51,337 INFO L290 TraceCheckUtils]: 45: Hoare triple {21772#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21773#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:51,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {21773#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21773#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:51,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {21773#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21774#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:51,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {21774#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21774#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:51,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {21774#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21775#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:51,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {21775#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {21775#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:51,339 INFO L290 TraceCheckUtils]: 51: Hoare triple {21775#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21776#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:51,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {21776#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {21776#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:51,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {21776#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21777#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:51,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {21777#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21777#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:51,341 INFO L290 TraceCheckUtils]: 55: Hoare triple {21777#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21778#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:51,341 INFO L290 TraceCheckUtils]: 56: Hoare triple {21778#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21778#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:51,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {21778#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21779#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:51,342 INFO L290 TraceCheckUtils]: 58: Hoare triple {21779#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21779#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:51,342 INFO L290 TraceCheckUtils]: 59: Hoare triple {21779#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21780#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:51,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {21780#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21780#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:51,343 INFO L290 TraceCheckUtils]: 61: Hoare triple {21780#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21781#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:51,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {21781#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21781#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:51,344 INFO L290 TraceCheckUtils]: 63: Hoare triple {21781#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21782#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:51,344 INFO L290 TraceCheckUtils]: 64: Hoare triple {21782#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {21782#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:51,345 INFO L290 TraceCheckUtils]: 65: Hoare triple {21782#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21985#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:51,345 INFO L290 TraceCheckUtils]: 66: Hoare triple {21985#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {21985#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:51,346 INFO L290 TraceCheckUtils]: 67: Hoare triple {21985#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21992#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:16:51,346 INFO L290 TraceCheckUtils]: 68: Hoare triple {21992#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {21992#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:16:51,346 INFO L290 TraceCheckUtils]: 69: Hoare triple {21992#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {21999#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:51,347 INFO L290 TraceCheckUtils]: 70: Hoare triple {21999#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {21999#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:51,348 INFO L272 TraceCheckUtils]: 71: Hoare triple {21999#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22006#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:51,348 INFO L290 TraceCheckUtils]: 72: Hoare triple {22006#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22010#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:51,348 INFO L290 TraceCheckUtils]: 73: Hoare triple {22010#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21749#false} is VALID [2022-04-28 09:16:51,348 INFO L290 TraceCheckUtils]: 74: Hoare triple {21749#false} assume !false; {21749#false} is VALID [2022-04-28 09:16:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:51,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:51,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {21749#false} assume !false; {21749#false} is VALID [2022-04-28 09:16:51,881 INFO L290 TraceCheckUtils]: 73: Hoare triple {22010#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21749#false} is VALID [2022-04-28 09:16:51,881 INFO L290 TraceCheckUtils]: 72: Hoare triple {22006#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22010#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:51,882 INFO L272 TraceCheckUtils]: 71: Hoare triple {22026#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22006#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:51,882 INFO L290 TraceCheckUtils]: 70: Hoare triple {22026#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {22026#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:51,883 INFO L290 TraceCheckUtils]: 69: Hoare triple {22026#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22026#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:51,883 INFO L290 TraceCheckUtils]: 68: Hoare triple {22026#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {22026#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:51,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {22026#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22026#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:51,884 INFO L290 TraceCheckUtils]: 66: Hoare triple {22026#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {22026#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:51,885 INFO L290 TraceCheckUtils]: 65: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22026#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:51,885 INFO L290 TraceCheckUtils]: 64: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,885 INFO L290 TraceCheckUtils]: 63: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,886 INFO L290 TraceCheckUtils]: 62: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,886 INFO L290 TraceCheckUtils]: 61: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,886 INFO L290 TraceCheckUtils]: 60: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,887 INFO L290 TraceCheckUtils]: 59: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,887 INFO L290 TraceCheckUtils]: 58: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,888 INFO L290 TraceCheckUtils]: 57: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,888 INFO L290 TraceCheckUtils]: 56: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,888 INFO L290 TraceCheckUtils]: 55: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,891 INFO L290 TraceCheckUtils]: 49: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,891 INFO L290 TraceCheckUtils]: 48: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,891 INFO L290 TraceCheckUtils]: 47: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {22045#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {21748#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {22045#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:51,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {21748#true} call #t~ret6 := main(); {21748#true} is VALID [2022-04-28 09:16:51,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21748#true} {21748#true} #42#return; {21748#true} is VALID [2022-04-28 09:16:51,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {21748#true} assume true; {21748#true} is VALID [2022-04-28 09:16:51,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {21748#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(14, 2);call #Ultimate.allocInit(12, 3); {21748#true} is VALID [2022-04-28 09:16:51,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {21748#true} call ULTIMATE.init(); {21748#true} is VALID [2022-04-28 09:16:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2022-04-28 09:16:51,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637682761] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:51,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:51,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37, 6] total 43 [2022-04-28 09:16:51,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:51,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1423705917] [2022-04-28 09:16:51,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1423705917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:51,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:51,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 09:16:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561404022] [2022-04-28 09:16:51,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 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 09:16:51,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:51,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 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 09:16:51,960 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 09:16:51,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 09:16:51,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:51,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 09:16:51,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1648, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 09:16:51,961 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 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 09:16:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:54,745 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-28 09:16:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 09:16:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 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 09:16:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:16:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 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 09:16:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 84 transitions. [2022-04-28 09:16:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 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 09:16:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 84 transitions. [2022-04-28 09:16:54,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 84 transitions. [2022-04-28 09:16:54,789 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 09:16:54,790 INFO L225 Difference]: With dead ends: 84 [2022-04-28 09:16:54,790 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 09:16:54,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=386, Invalid=5314, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 09:16:54,791 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 73 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2203 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:16:54,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 133 Invalid, 2270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2203 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 09:16:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 09:16:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-28 09:16:54,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:16:54,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 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 09:16:54,997 INFO L74 IsIncluded]: Start isIncluded. First operand 79 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 09:16:54,997 INFO L87 Difference]: Start difference. First operand 79 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 09:16:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:54,997 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-28 09:16:54,998 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-28 09:16:54,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:54,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:54,998 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 79 states. [2022-04-28 09:16:54,998 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 79 states. [2022-04-28 09:16:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:16:54,999 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-28 09:16:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-28 09:16:54,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:16:54,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:16:54,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:16:54,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:16:54,999 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 09:16:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2022-04-28 09:16:55,000 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2022-04-28 09:16:55,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:16:55,000 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2022-04-28 09:16:55,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 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 09:16:55,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 78 transitions. [2022-04-28 09:16:55,119 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 09:16:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-28 09:16:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 09:16:55,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:16:55,120 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:16:55,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-28 09:16:55,320 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,SelfDestructingSolverStorable41 [2022-04-28 09:16:55,321 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:16:55,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:16:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1732740347, now seen corresponding path program 65 times [2022-04-28 09:16:55,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:55,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [571306151] [2022-04-28 09:16:55,323 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:16:55,324 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:16:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1732740347, now seen corresponding path program 66 times [2022-04-28 09:16:55,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:16:55,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606694450] [2022-04-28 09:16:55,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:16:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:16:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:55,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:16:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:55,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {22830#(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(14, 2);call #Ultimate.allocInit(12, 3); {22791#true} is VALID [2022-04-28 09:16:55,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {22791#true} assume true; {22791#true} is VALID [2022-04-28 09:16:55,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22791#true} {22791#true} #42#return; {22791#true} is VALID [2022-04-28 09:16:55,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {22791#true} call ULTIMATE.init(); {22830#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:16:55,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {22830#(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(14, 2);call #Ultimate.allocInit(12, 3); {22791#true} is VALID [2022-04-28 09:16:55,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {22791#true} assume true; {22791#true} is VALID [2022-04-28 09:16:55,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22791#true} {22791#true} #42#return; {22791#true} is VALID [2022-04-28 09:16:55,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {22791#true} call #t~ret6 := main(); {22791#true} is VALID [2022-04-28 09:16:55,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {22791#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {22796#(= main_~x~0 0)} is VALID [2022-04-28 09:16:55,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {22796#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {22796#(= main_~x~0 0)} is VALID [2022-04-28 09:16:55,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {22796#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22797#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:55,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {22797#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {22797#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:55,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {22797#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22798#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:55,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {22798#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22798#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:55,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {22798#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22799#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:55,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {22799#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {22799#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:55,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {22799#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22800#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:55,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {22800#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22800#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:55,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {22800#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22801#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:55,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {22801#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22801#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:55,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {22801#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22802#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:55,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {22802#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22802#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:55,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {22802#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22803#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:55,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {22803#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {22803#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:55,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {22803#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22804#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:55,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {22804#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22804#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:55,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {22804#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22805#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:55,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {22805#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22805#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:55,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {22805#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22806#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:55,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {22806#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22806#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:55,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {22806#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22807#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:55,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {22807#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {22807#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:55,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {22807#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22808#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:55,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {22808#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22808#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:55,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {22808#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22809#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:55,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {22809#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22809#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:55,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {22809#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22810#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:55,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {22810#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {22810#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:55,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {22810#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22811#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:55,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {22811#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {22811#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:55,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {22811#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22812#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:55,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {22812#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22812#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:55,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {22812#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22813#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:55,946 INFO L290 TraceCheckUtils]: 40: Hoare triple {22813#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22813#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:16:55,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {22813#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22814#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:55,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {22814#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22814#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:16:55,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {22814#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22815#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:55,947 INFO L290 TraceCheckUtils]: 44: Hoare triple {22815#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22815#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:55,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {22815#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22816#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:55,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {22816#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22816#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:55,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {22816#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22817#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:55,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {22817#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22817#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:16:55,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {22817#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22818#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:55,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {22818#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {22818#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:55,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {22818#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22819#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:55,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {22819#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {22819#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:55,950 INFO L290 TraceCheckUtils]: 53: Hoare triple {22819#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22820#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:55,950 INFO L290 TraceCheckUtils]: 54: Hoare triple {22820#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22820#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:55,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {22820#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22821#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:55,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {22821#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22821#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:16:55,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {22821#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22822#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:55,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {22822#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22822#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:16:55,952 INFO L290 TraceCheckUtils]: 59: Hoare triple {22822#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22823#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:55,952 INFO L290 TraceCheckUtils]: 60: Hoare triple {22823#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22823#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:55,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {22823#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22824#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:55,953 INFO L290 TraceCheckUtils]: 62: Hoare triple {22824#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22824#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:55,953 INFO L290 TraceCheckUtils]: 63: Hoare triple {22824#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22825#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:55,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {22825#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {22825#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:55,953 INFO L290 TraceCheckUtils]: 65: Hoare triple {22825#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22826#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:16:55,954 INFO L290 TraceCheckUtils]: 66: Hoare triple {22826#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22826#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:16:55,954 INFO L290 TraceCheckUtils]: 67: Hoare triple {22826#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22827#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:16:55,954 INFO L290 TraceCheckUtils]: 68: Hoare triple {22827#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {22827#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:16:55,955 INFO L290 TraceCheckUtils]: 69: Hoare triple {22827#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22828#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:16:55,955 INFO L290 TraceCheckUtils]: 70: Hoare triple {22828#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22828#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:16:55,955 INFO L290 TraceCheckUtils]: 71: Hoare triple {22828#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22829#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 66))} is VALID [2022-04-28 09:16:55,956 INFO L290 TraceCheckUtils]: 72: Hoare triple {22829#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 66))} assume !(~x~0 % 4294967296 < 99); {22792#false} is VALID [2022-04-28 09:16:55,956 INFO L272 TraceCheckUtils]: 73: Hoare triple {22792#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22792#false} is VALID [2022-04-28 09:16:55,956 INFO L290 TraceCheckUtils]: 74: Hoare triple {22792#false} ~cond := #in~cond; {22792#false} is VALID [2022-04-28 09:16:55,956 INFO L290 TraceCheckUtils]: 75: Hoare triple {22792#false} assume 0 == ~cond; {22792#false} is VALID [2022-04-28 09:16:55,956 INFO L290 TraceCheckUtils]: 76: Hoare triple {22792#false} assume !false; {22792#false} is VALID [2022-04-28 09:16:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:55,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:16:55,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606694450] [2022-04-28 09:16:55,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606694450] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:16:55,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654377206] [2022-04-28 09:16:55,957 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:16:55,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:16:55,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:16:55,958 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 09:16:55,970 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 09:16:56,889 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-28 09:16:56,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:16:56,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-28 09:16:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:16:56,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:16:58,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {22791#true} call ULTIMATE.init(); {22791#true} is VALID [2022-04-28 09:16:58,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {22791#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(14, 2);call #Ultimate.allocInit(12, 3); {22791#true} is VALID [2022-04-28 09:16:58,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {22791#true} assume true; {22791#true} is VALID [2022-04-28 09:16:58,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22791#true} {22791#true} #42#return; {22791#true} is VALID [2022-04-28 09:16:58,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {22791#true} call #t~ret6 := main(); {22791#true} is VALID [2022-04-28 09:16:58,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {22791#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {22796#(= main_~x~0 0)} is VALID [2022-04-28 09:16:58,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {22796#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {22796#(= main_~x~0 0)} is VALID [2022-04-28 09:16:58,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {22796#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22797#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:58,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {22797#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {22797#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:16:58,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {22797#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22798#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:58,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {22798#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22798#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:16:58,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {22798#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22799#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:58,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {22799#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {22799#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:16:58,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {22799#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22800#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:58,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {22800#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22800#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:16:58,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {22800#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22801#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:58,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {22801#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22801#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:16:58,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {22801#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22802#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:58,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {22802#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22802#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:16:58,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {22802#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22803#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:58,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {22803#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {22803#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:16:58,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {22803#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22804#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:58,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {22804#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22804#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:16:58,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {22804#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22805#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:58,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {22805#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22805#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:16:58,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {22805#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22806#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:58,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {22806#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22806#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:16:58,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {22806#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22807#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:58,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {22807#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {22807#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:16:58,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {22807#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22808#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:58,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {22808#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22808#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:16:58,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {22808#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22809#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:58,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {22809#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22809#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:16:58,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {22809#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22810#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:58,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {22810#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {22810#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:16:58,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {22810#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22811#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:58,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {22811#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {22811#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:16:58,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {22811#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22812#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:58,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {22812#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22812#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:16:58,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {22812#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22951#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {22951#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {22951#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {22951#(and (<= main_~x~0 34) (<= 34 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22958#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {22958#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {22958#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {22958#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22965#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:58,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {22965#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22965#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} is VALID [2022-04-28 09:16:58,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {22965#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22972#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:58,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {22972#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22972#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:16:58,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {22972#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22979#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {22979#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {22979#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {22979#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22986#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:58,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {22986#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {22986#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:16:58,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {22986#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {22993#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:58,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {22993#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {22993#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:16:58,372 INFO L290 TraceCheckUtils]: 53: Hoare triple {22993#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23000#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:58,372 INFO L290 TraceCheckUtils]: 54: Hoare triple {23000#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23000#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:16:58,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {23000#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23007#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {23007#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {23007#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,374 INFO L290 TraceCheckUtils]: 57: Hoare triple {23007#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23014#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {23014#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {23014#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {23014#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23021#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:58,375 INFO L290 TraceCheckUtils]: 60: Hoare triple {23021#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23021#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:16:58,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {23021#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23028#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:58,376 INFO L290 TraceCheckUtils]: 62: Hoare triple {23028#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23028#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:16:58,376 INFO L290 TraceCheckUtils]: 63: Hoare triple {23028#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23035#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:58,377 INFO L290 TraceCheckUtils]: 64: Hoare triple {23035#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {23035#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:16:58,377 INFO L290 TraceCheckUtils]: 65: Hoare triple {23035#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23042#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,378 INFO L290 TraceCheckUtils]: 66: Hoare triple {23042#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {23042#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,378 INFO L290 TraceCheckUtils]: 67: Hoare triple {23042#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23049#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:16:58,378 INFO L290 TraceCheckUtils]: 68: Hoare triple {23049#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {23049#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:16:58,379 INFO L290 TraceCheckUtils]: 69: Hoare triple {23049#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23056#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,379 INFO L290 TraceCheckUtils]: 70: Hoare triple {23056#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {23056#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:16:58,380 INFO L290 TraceCheckUtils]: 71: Hoare triple {23056#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23063#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:16:58,380 INFO L290 TraceCheckUtils]: 72: Hoare triple {23063#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume !(~x~0 % 4294967296 < 99); {23063#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:16:58,381 INFO L272 TraceCheckUtils]: 73: Hoare triple {23063#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:58,381 INFO L290 TraceCheckUtils]: 74: Hoare triple {23070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:58,382 INFO L290 TraceCheckUtils]: 75: Hoare triple {23074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22792#false} is VALID [2022-04-28 09:16:58,382 INFO L290 TraceCheckUtils]: 76: Hoare triple {22792#false} assume !false; {22792#false} is VALID [2022-04-28 09:16:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:16:58,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:16:58,896 INFO L290 TraceCheckUtils]: 76: Hoare triple {22792#false} assume !false; {22792#false} is VALID [2022-04-28 09:16:58,897 INFO L290 TraceCheckUtils]: 75: Hoare triple {23074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22792#false} is VALID [2022-04-28 09:16:58,897 INFO L290 TraceCheckUtils]: 74: Hoare triple {23070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:16:58,897 INFO L272 TraceCheckUtils]: 73: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:16:58,898 INFO L290 TraceCheckUtils]: 72: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,898 INFO L290 TraceCheckUtils]: 71: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,899 INFO L290 TraceCheckUtils]: 70: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,899 INFO L290 TraceCheckUtils]: 69: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,899 INFO L290 TraceCheckUtils]: 68: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,900 INFO L290 TraceCheckUtils]: 67: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,900 INFO L290 TraceCheckUtils]: 66: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,901 INFO L290 TraceCheckUtils]: 65: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,901 INFO L290 TraceCheckUtils]: 64: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,901 INFO L290 TraceCheckUtils]: 63: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,902 INFO L290 TraceCheckUtils]: 62: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,902 INFO L290 TraceCheckUtils]: 61: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,903 INFO L290 TraceCheckUtils]: 59: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,905 INFO L290 TraceCheckUtils]: 55: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23090#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:16:58,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {23193#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {22791#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {23193#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:16:58,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {22791#true} call #t~ret6 := main(); {22791#true} is VALID [2022-04-28 09:16:58,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22791#true} {22791#true} #42#return; {22791#true} is VALID [2022-04-28 09:16:58,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {22791#true} assume true; {22791#true} is VALID [2022-04-28 09:16:58,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {22791#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(14, 2);call #Ultimate.allocInit(12, 3); {22791#true} is VALID [2022-04-28 09:16:58,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {22791#true} call ULTIMATE.init(); {22791#true} is VALID [2022-04-28 09:16:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-04-28 09:16:58,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654377206] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:16:58,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:16:58,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 6] total 58 [2022-04-28 09:16:58,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:16:58,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [571306151] [2022-04-28 09:16:58,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [571306151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:16:58,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:16:58,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 09:16:58,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782492198] [2022-04-28 09:16:58,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:16:58,925 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 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 09:16:58,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:16:58,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 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 09:16:58,968 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 09:16:58,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 09:16:58,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:16:58,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 09:16:58,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3060, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 09:16:58,971 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 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 09:17:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:02,467 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-28 09:17:02,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 09:17:02,467 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 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 09:17:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 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 09:17:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 86 transitions. [2022-04-28 09:17:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 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 09:17:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 86 transitions. [2022-04-28 09:17:02,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 86 transitions. [2022-04-28 09:17:02,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:02,535 INFO L225 Difference]: With dead ends: 86 [2022-04-28 09:17:02,535 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 09:17:02,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=481, Invalid=7891, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 09:17:02,536 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 75 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:02,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 168 Invalid, 2438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 09:17:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 09:17:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-28 09:17:02,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:02,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 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 09:17:02,864 INFO L74 IsIncluded]: Start isIncluded. First operand 81 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 09:17:02,864 INFO L87 Difference]: Start difference. First operand 81 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 09:17:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:02,865 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2022-04-28 09:17:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2022-04-28 09:17:02,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:02,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:02,865 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 81 states. [2022-04-28 09:17:02,865 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 81 states. [2022-04-28 09:17:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:02,866 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2022-04-28 09:17:02,866 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2022-04-28 09:17:02,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:02,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:02,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:02,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:02,866 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 09:17:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2022-04-28 09:17:02,867 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2022-04-28 09:17:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:02,867 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2022-04-28 09:17:02,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 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 09:17:02,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 80 transitions. [2022-04-28 09:17:02,973 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 09:17:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-28 09:17:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 09:17:02,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:02,974 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:02,980 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 09:17:03,174 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,SelfDestructingSolverStorable42 [2022-04-28 09:17:03,174 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1969163710, now seen corresponding path program 67 times [2022-04-28 09:17:03,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:03,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1313937059] [2022-04-28 09:17:03,177 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:03,177 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:03,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1969163710, now seen corresponding path program 68 times [2022-04-28 09:17:03,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:03,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049771427] [2022-04-28 09:17:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:03,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:03,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:03,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {23915#(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(14, 2);call #Ultimate.allocInit(12, 3); {23875#true} is VALID [2022-04-28 09:17:03,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {23875#true} assume true; {23875#true} is VALID [2022-04-28 09:17:03,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23875#true} {23875#true} #42#return; {23875#true} is VALID [2022-04-28 09:17:03,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {23875#true} call ULTIMATE.init(); {23915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:03,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {23915#(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(14, 2);call #Ultimate.allocInit(12, 3); {23875#true} is VALID [2022-04-28 09:17:03,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {23875#true} assume true; {23875#true} is VALID [2022-04-28 09:17:03,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23875#true} {23875#true} #42#return; {23875#true} is VALID [2022-04-28 09:17:03,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {23875#true} call #t~ret6 := main(); {23875#true} is VALID [2022-04-28 09:17:03,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {23875#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {23880#(= main_~x~0 0)} is VALID [2022-04-28 09:17:03,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {23880#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {23880#(= main_~x~0 0)} is VALID [2022-04-28 09:17:03,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {23880#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23881#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:03,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {23881#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {23881#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:03,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {23881#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23882#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:03,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {23882#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23882#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:03,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {23882#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:03,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {23883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {23883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:03,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {23883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23884#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:03,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {23884#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23884#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:03,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {23884#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23885#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:03,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {23885#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23885#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:03,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {23885#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23886#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:03,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {23886#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23886#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:03,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {23886#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23887#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:03,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {23887#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {23887#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:03,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {23887#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:03,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {23888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:03,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {23888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23889#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:03,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {23889#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23889#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:03,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {23889#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23890#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:03,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {23890#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23890#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:03,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {23890#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23891#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:03,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {23891#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {23891#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:03,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {23891#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23892#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:03,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {23892#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23892#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:03,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {23892#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23893#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:03,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {23893#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23893#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:03,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {23893#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23894#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:03,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {23894#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {23894#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:03,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {23894#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23895#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:03,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {23895#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {23895#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:03,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {23895#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23896#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:03,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {23896#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23896#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:03,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {23896#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23897#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:03,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {23897#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23897#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:03,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {23897#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23898#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:03,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {23898#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23898#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:03,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {23898#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23899#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:03,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {23899#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23899#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:03,940 INFO L290 TraceCheckUtils]: 45: Hoare triple {23899#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23900#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:03,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {23900#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23900#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:03,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {23900#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23901#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:03,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {23901#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23901#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:03,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {23901#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23902#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:03,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {23902#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {23902#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:03,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {23902#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23903#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:03,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {23903#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {23903#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:03,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {23903#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23904#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:03,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {23904#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23904#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:03,944 INFO L290 TraceCheckUtils]: 55: Hoare triple {23904#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23905#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:03,944 INFO L290 TraceCheckUtils]: 56: Hoare triple {23905#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23905#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:03,944 INFO L290 TraceCheckUtils]: 57: Hoare triple {23905#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23906#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:03,945 INFO L290 TraceCheckUtils]: 58: Hoare triple {23906#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23906#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:03,945 INFO L290 TraceCheckUtils]: 59: Hoare triple {23906#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23907#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:03,945 INFO L290 TraceCheckUtils]: 60: Hoare triple {23907#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23907#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:03,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {23907#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23908#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:03,946 INFO L290 TraceCheckUtils]: 62: Hoare triple {23908#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23908#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:03,947 INFO L290 TraceCheckUtils]: 63: Hoare triple {23908#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23909#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:03,947 INFO L290 TraceCheckUtils]: 64: Hoare triple {23909#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {23909#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:03,947 INFO L290 TraceCheckUtils]: 65: Hoare triple {23909#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23910#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:03,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {23910#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23910#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:03,948 INFO L290 TraceCheckUtils]: 67: Hoare triple {23910#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23911#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:03,949 INFO L290 TraceCheckUtils]: 68: Hoare triple {23911#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {23911#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:03,949 INFO L290 TraceCheckUtils]: 69: Hoare triple {23911#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23912#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:03,949 INFO L290 TraceCheckUtils]: 70: Hoare triple {23912#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23912#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:03,950 INFO L290 TraceCheckUtils]: 71: Hoare triple {23912#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23913#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:03,950 INFO L290 TraceCheckUtils]: 72: Hoare triple {23913#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {23913#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:03,951 INFO L290 TraceCheckUtils]: 73: Hoare triple {23913#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23914#(and (<= main_~x~0 68) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:03,951 INFO L290 TraceCheckUtils]: 74: Hoare triple {23914#(and (<= main_~x~0 68) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {23876#false} is VALID [2022-04-28 09:17:03,951 INFO L272 TraceCheckUtils]: 75: Hoare triple {23876#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23876#false} is VALID [2022-04-28 09:17:03,951 INFO L290 TraceCheckUtils]: 76: Hoare triple {23876#false} ~cond := #in~cond; {23876#false} is VALID [2022-04-28 09:17:03,951 INFO L290 TraceCheckUtils]: 77: Hoare triple {23876#false} assume 0 == ~cond; {23876#false} is VALID [2022-04-28 09:17:03,951 INFO L290 TraceCheckUtils]: 78: Hoare triple {23876#false} assume !false; {23876#false} is VALID [2022-04-28 09:17:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:03,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:03,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049771427] [2022-04-28 09:17:03,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049771427] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:03,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888160541] [2022-04-28 09:17:03,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:17:03,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:03,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:03,953 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 09:17:03,954 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 09:17:04,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:17:04,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:04,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-28 09:17:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:04,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:04,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {23875#true} call ULTIMATE.init(); {23875#true} is VALID [2022-04-28 09:17:04,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {23875#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(14, 2);call #Ultimate.allocInit(12, 3); {23875#true} is VALID [2022-04-28 09:17:04,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {23875#true} assume true; {23875#true} is VALID [2022-04-28 09:17:04,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23875#true} {23875#true} #42#return; {23875#true} is VALID [2022-04-28 09:17:04,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {23875#true} call #t~ret6 := main(); {23875#true} is VALID [2022-04-28 09:17:04,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {23875#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {23880#(= main_~x~0 0)} is VALID [2022-04-28 09:17:04,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {23880#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {23880#(= main_~x~0 0)} is VALID [2022-04-28 09:17:04,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {23880#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23881#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:04,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {23881#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {23881#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:04,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {23881#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23882#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:04,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {23882#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23882#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:04,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {23882#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:04,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {23883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {23883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:04,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {23883#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23884#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:04,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {23884#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23884#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:04,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {23884#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23885#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:04,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {23885#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23885#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:04,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {23885#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23886#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:04,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {23886#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23886#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:04,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {23886#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23887#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:04,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {23887#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {23887#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:04,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {23887#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:04,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {23888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:04,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {23888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23889#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:04,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {23889#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23889#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:04,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {23889#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23890#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:04,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {23890#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23890#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:04,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {23890#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23891#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:04,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {23891#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {23891#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:04,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {23891#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23892#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:04,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {23892#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23892#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:04,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {23892#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23893#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:04,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {23893#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23893#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:04,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {23893#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23894#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:04,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {23894#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {23894#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:04,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {23894#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23895#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:04,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {23895#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {23895#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:04,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {23895#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23896#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:04,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {23896#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23896#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:04,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {23896#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23897#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:04,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {23897#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23897#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:04,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {23897#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23898#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:04,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {23898#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23898#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:04,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {23898#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23899#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:04,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {23899#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23899#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:04,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {23899#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23900#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:04,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {23900#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23900#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:04,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {23900#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23901#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:04,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {23901#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23901#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:04,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {23901#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23902#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:04,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {23902#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {23902#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:04,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {23902#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23903#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:04,678 INFO L290 TraceCheckUtils]: 52: Hoare triple {23903#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {23903#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:04,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {23903#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23904#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:04,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {23904#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23904#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:04,679 INFO L290 TraceCheckUtils]: 55: Hoare triple {23904#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23905#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:04,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {23905#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23905#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:04,680 INFO L290 TraceCheckUtils]: 57: Hoare triple {23905#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23906#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:04,680 INFO L290 TraceCheckUtils]: 58: Hoare triple {23906#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23906#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:04,680 INFO L290 TraceCheckUtils]: 59: Hoare triple {23906#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23907#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:04,681 INFO L290 TraceCheckUtils]: 60: Hoare triple {23907#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23907#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:04,681 INFO L290 TraceCheckUtils]: 61: Hoare triple {23907#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23908#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:04,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {23908#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23908#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:04,682 INFO L290 TraceCheckUtils]: 63: Hoare triple {23908#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23909#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:04,682 INFO L290 TraceCheckUtils]: 64: Hoare triple {23909#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {23909#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:04,683 INFO L290 TraceCheckUtils]: 65: Hoare triple {23909#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23910#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:04,683 INFO L290 TraceCheckUtils]: 66: Hoare triple {23910#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23910#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:04,684 INFO L290 TraceCheckUtils]: 67: Hoare triple {23910#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23911#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:04,684 INFO L290 TraceCheckUtils]: 68: Hoare triple {23911#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {23911#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:04,684 INFO L290 TraceCheckUtils]: 69: Hoare triple {23911#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23912#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:04,685 INFO L290 TraceCheckUtils]: 70: Hoare triple {23912#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {23912#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:04,685 INFO L290 TraceCheckUtils]: 71: Hoare triple {23912#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {23913#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:04,685 INFO L290 TraceCheckUtils]: 72: Hoare triple {23913#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {23913#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:04,686 INFO L290 TraceCheckUtils]: 73: Hoare triple {23913#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24138#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:17:04,686 INFO L290 TraceCheckUtils]: 74: Hoare triple {24138#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {23876#false} is VALID [2022-04-28 09:17:04,686 INFO L272 TraceCheckUtils]: 75: Hoare triple {23876#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23876#false} is VALID [2022-04-28 09:17:04,687 INFO L290 TraceCheckUtils]: 76: Hoare triple {23876#false} ~cond := #in~cond; {23876#false} is VALID [2022-04-28 09:17:04,687 INFO L290 TraceCheckUtils]: 77: Hoare triple {23876#false} assume 0 == ~cond; {23876#false} is VALID [2022-04-28 09:17:04,687 INFO L290 TraceCheckUtils]: 78: Hoare triple {23876#false} assume !false; {23876#false} is VALID [2022-04-28 09:17:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:04,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:06,174 INFO L290 TraceCheckUtils]: 78: Hoare triple {23876#false} assume !false; {23876#false} is VALID [2022-04-28 09:17:06,174 INFO L290 TraceCheckUtils]: 77: Hoare triple {23876#false} assume 0 == ~cond; {23876#false} is VALID [2022-04-28 09:17:06,174 INFO L290 TraceCheckUtils]: 76: Hoare triple {23876#false} ~cond := #in~cond; {23876#false} is VALID [2022-04-28 09:17:06,174 INFO L272 TraceCheckUtils]: 75: Hoare triple {23876#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23876#false} is VALID [2022-04-28 09:17:06,175 INFO L290 TraceCheckUtils]: 74: Hoare triple {24166#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {23876#false} is VALID [2022-04-28 09:17:06,175 INFO L290 TraceCheckUtils]: 73: Hoare triple {24170#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24166#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:17:06,175 INFO L290 TraceCheckUtils]: 72: Hoare triple {24170#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24170#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:17:06,176 INFO L290 TraceCheckUtils]: 71: Hoare triple {24177#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24170#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:17:06,176 INFO L290 TraceCheckUtils]: 70: Hoare triple {24177#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24177#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:17:06,177 INFO L290 TraceCheckUtils]: 69: Hoare triple {24184#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24177#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:17:06,177 INFO L290 TraceCheckUtils]: 68: Hoare triple {24184#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24184#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:17:06,178 INFO L290 TraceCheckUtils]: 67: Hoare triple {24191#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24184#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:17:06,178 INFO L290 TraceCheckUtils]: 66: Hoare triple {24191#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24191#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:17:06,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {24198#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24191#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:17:06,179 INFO L290 TraceCheckUtils]: 64: Hoare triple {24198#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24198#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:17:06,179 INFO L290 TraceCheckUtils]: 63: Hoare triple {24205#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24198#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:17:06,179 INFO L290 TraceCheckUtils]: 62: Hoare triple {24205#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24205#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:17:06,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {24212#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24205#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:17:06,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {24212#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24212#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:17:06,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {24219#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24212#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:17:06,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {24219#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24219#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:17:06,200 INFO L290 TraceCheckUtils]: 57: Hoare triple {24226#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24219#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:17:06,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {24226#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24226#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:17:06,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {24233#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24226#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:17:06,201 INFO L290 TraceCheckUtils]: 54: Hoare triple {24233#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24233#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:17:06,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {24240#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24233#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:17:06,202 INFO L290 TraceCheckUtils]: 52: Hoare triple {24240#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24240#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:17:06,202 INFO L290 TraceCheckUtils]: 51: Hoare triple {24247#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24240#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:17:06,202 INFO L290 TraceCheckUtils]: 50: Hoare triple {24247#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24247#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:17:06,203 INFO L290 TraceCheckUtils]: 49: Hoare triple {24254#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24247#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:17:06,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {24254#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24254#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:17:06,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {24261#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24254#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:17:06,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {24261#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24261#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-28 09:17:06,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {24268#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24261#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-28 09:17:06,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {24268#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24268#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {24275#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24268#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {24275#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24275#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {24282#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24275#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {24282#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24282#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-28 09:17:06,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {24289#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24282#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-28 09:17:06,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {24289#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24289#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-28 09:17:06,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {24296#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24289#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-28 09:17:06,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {24296#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24296#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-28 09:17:06,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {24303#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24296#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-28 09:17:06,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {24303#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24303#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {24310#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24303#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {24310#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24310#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {24317#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24310#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {24317#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24317#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {24324#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24317#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {24324#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24324#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-28 09:17:06,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {24331#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24324#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-28 09:17:06,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {24331#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24331#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-28 09:17:06,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {24338#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24331#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-28 09:17:06,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {24338#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24338#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-28 09:17:06,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {24345#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24338#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-28 09:17:06,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {24345#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24345#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-28 09:17:06,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {24352#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24345#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-28 09:17:06,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {24352#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24352#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-28 09:17:06,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {24359#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24352#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-28 09:17:06,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {24359#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24359#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {24366#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24359#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {24366#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24366#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-28 09:17:06,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {24373#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24366#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-28 09:17:06,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {24373#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24373#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-28 09:17:06,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {24380#(< (mod (+ main_~x~0 62) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24373#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-28 09:17:06,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {24380#(< (mod (+ main_~x~0 62) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24380#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-28 09:17:06,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {24387#(< (mod (+ 64 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24380#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-28 09:17:06,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {24387#(< (mod (+ 64 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24387#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {24394#(< (mod (+ 66 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24387#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {24394#(< (mod (+ 66 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24394#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {24401#(< (mod (+ 68 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {24394#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {24401#(< (mod (+ 68 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {24401#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {23875#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {24401#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:17:06,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {23875#true} call #t~ret6 := main(); {23875#true} is VALID [2022-04-28 09:17:06,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23875#true} {23875#true} #42#return; {23875#true} is VALID [2022-04-28 09:17:06,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {23875#true} assume true; {23875#true} is VALID [2022-04-28 09:17:06,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {23875#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(14, 2);call #Ultimate.allocInit(12, 3); {23875#true} is VALID [2022-04-28 09:17:06,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {23875#true} call ULTIMATE.init(); {23875#true} is VALID [2022-04-28 09:17:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:06,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888160541] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:06,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:06,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-28 09:17:06,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:06,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1313937059] [2022-04-28 09:17:06,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1313937059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:06,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:06,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 09:17:06,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827444334] [2022-04-28 09:17:06,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:06,223 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 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 79 [2022-04-28 09:17:06,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:06,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:06,285 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 09:17:06,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 09:17:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:06,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 09:17:06,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1231, Invalid=4171, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 09:17:06,287 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:10,173 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-04-28 09:17:10,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 09:17:10,173 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 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 79 [2022-04-28 09:17:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 88 transitions. [2022-04-28 09:17:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 88 transitions. [2022-04-28 09:17:10,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 88 transitions. [2022-04-28 09:17:10,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:10,243 INFO L225 Difference]: With dead ends: 88 [2022-04-28 09:17:10,243 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 09:17:10,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1143 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2474, Invalid=9298, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 09:17:10,245 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:10,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 78 Invalid, 2485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 09:17:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 09:17:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2022-04-28 09:17:10,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:10,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 82 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:10,596 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 82 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:10,596 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 82 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:10,597 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2022-04-28 09:17:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2022-04-28 09:17:10,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:10,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:10,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 3 states have call successors, (3), 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 83 states. [2022-04-28 09:17:10,597 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 3 states have call successors, (3), 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 83 states. [2022-04-28 09:17:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:10,598 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2022-04-28 09:17:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2022-04-28 09:17:10,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:10,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:10,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:10,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2022-04-28 09:17:10,599 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2022-04-28 09:17:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:10,599 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2022-04-28 09:17:10,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:10,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 82 transitions. [2022-04-28 09:17:10,710 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 09:17:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2022-04-28 09:17:10,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 09:17:10,710 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:10,710 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:10,734 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 09:17:10,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-28 09:17:10,911 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:10,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:10,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1538748865, now seen corresponding path program 69 times [2022-04-28 09:17:10,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:10,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [663749614] [2022-04-28 09:17:10,914 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:10,914 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:10,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1538748865, now seen corresponding path program 70 times [2022-04-28 09:17:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:10,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385227174] [2022-04-28 09:17:10,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:11,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {25042#(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(14, 2);call #Ultimate.allocInit(12, 3); {25001#true} is VALID [2022-04-28 09:17:11,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {25001#true} assume true; {25001#true} is VALID [2022-04-28 09:17:11,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25001#true} {25001#true} #42#return; {25001#true} is VALID [2022-04-28 09:17:11,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {25001#true} call ULTIMATE.init(); {25042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:11,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {25042#(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(14, 2);call #Ultimate.allocInit(12, 3); {25001#true} is VALID [2022-04-28 09:17:11,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {25001#true} assume true; {25001#true} is VALID [2022-04-28 09:17:11,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25001#true} {25001#true} #42#return; {25001#true} is VALID [2022-04-28 09:17:11,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {25001#true} call #t~ret6 := main(); {25001#true} is VALID [2022-04-28 09:17:11,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {25001#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {25006#(= main_~x~0 0)} is VALID [2022-04-28 09:17:11,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {25006#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {25006#(= main_~x~0 0)} is VALID [2022-04-28 09:17:11,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {25006#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:11,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {25007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {25007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:11,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {25007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25008#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:11,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {25008#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25008#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:11,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {25008#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25009#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:11,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {25009#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {25009#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:11,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {25009#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25010#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:11,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {25010#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25010#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:11,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {25010#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:11,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {25011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:11,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {25011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:11,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {25012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:11,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {25012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25013#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:11,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {25013#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {25013#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:11,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {25013#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:11,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {25014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:11,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {25014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:11,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {25015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:11,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {25015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25016#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:11,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {25016#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25016#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:11,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {25016#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25017#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:11,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {25017#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {25017#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:11,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {25017#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:11,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {25018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:11,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {25018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:11,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {25019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:11,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {25019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25020#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:11,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {25020#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {25020#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:11,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {25020#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:11,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {25021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {25021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:11,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {25021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:11,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {25022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:11,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {25022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25023#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:11,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {25023#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25023#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:11,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {25023#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25024#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:11,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {25024#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25024#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:11,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {25024#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25025#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:11,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {25025#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25025#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:11,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {25025#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25026#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:11,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {25026#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25026#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:11,724 INFO L290 TraceCheckUtils]: 47: Hoare triple {25026#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25027#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:11,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {25027#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25027#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:11,725 INFO L290 TraceCheckUtils]: 49: Hoare triple {25027#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25028#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:11,725 INFO L290 TraceCheckUtils]: 50: Hoare triple {25028#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {25028#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:11,725 INFO L290 TraceCheckUtils]: 51: Hoare triple {25028#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25029#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:11,726 INFO L290 TraceCheckUtils]: 52: Hoare triple {25029#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {25029#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:11,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {25029#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25030#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:11,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {25030#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25030#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:11,727 INFO L290 TraceCheckUtils]: 55: Hoare triple {25030#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25031#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:11,727 INFO L290 TraceCheckUtils]: 56: Hoare triple {25031#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25031#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:11,728 INFO L290 TraceCheckUtils]: 57: Hoare triple {25031#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25032#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:11,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {25032#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25032#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:11,729 INFO L290 TraceCheckUtils]: 59: Hoare triple {25032#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25033#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:11,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {25033#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25033#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:11,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {25033#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25034#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:11,730 INFO L290 TraceCheckUtils]: 62: Hoare triple {25034#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25034#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:11,730 INFO L290 TraceCheckUtils]: 63: Hoare triple {25034#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25035#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:11,730 INFO L290 TraceCheckUtils]: 64: Hoare triple {25035#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {25035#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:11,731 INFO L290 TraceCheckUtils]: 65: Hoare triple {25035#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25036#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:11,731 INFO L290 TraceCheckUtils]: 66: Hoare triple {25036#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25036#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:11,732 INFO L290 TraceCheckUtils]: 67: Hoare triple {25036#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25037#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:11,732 INFO L290 TraceCheckUtils]: 68: Hoare triple {25037#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {25037#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:11,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {25037#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25038#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:11,733 INFO L290 TraceCheckUtils]: 70: Hoare triple {25038#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25038#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:11,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {25038#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25039#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:11,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {25039#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {25039#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:11,735 INFO L290 TraceCheckUtils]: 73: Hoare triple {25039#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25040#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:17:11,735 INFO L290 TraceCheckUtils]: 74: Hoare triple {25040#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25040#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:17:11,735 INFO L290 TraceCheckUtils]: 75: Hoare triple {25040#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25041#(and (<= main_~x~0 70) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:11,736 INFO L290 TraceCheckUtils]: 76: Hoare triple {25041#(and (<= main_~x~0 70) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {25002#false} is VALID [2022-04-28 09:17:11,736 INFO L272 TraceCheckUtils]: 77: Hoare triple {25002#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {25002#false} is VALID [2022-04-28 09:17:11,736 INFO L290 TraceCheckUtils]: 78: Hoare triple {25002#false} ~cond := #in~cond; {25002#false} is VALID [2022-04-28 09:17:11,736 INFO L290 TraceCheckUtils]: 79: Hoare triple {25002#false} assume 0 == ~cond; {25002#false} is VALID [2022-04-28 09:17:11,736 INFO L290 TraceCheckUtils]: 80: Hoare triple {25002#false} assume !false; {25002#false} is VALID [2022-04-28 09:17:11,736 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 09:17:11,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:11,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385227174] [2022-04-28 09:17:11,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385227174] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:11,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155744807] [2022-04-28 09:17:11,737 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:17:11,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:11,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:11,738 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 09:17:11,740 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 09:17:11,791 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:17:11,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:11,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-28 09:17:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:11,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:13,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {25001#true} call ULTIMATE.init(); {25001#true} is VALID [2022-04-28 09:17:13,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {25001#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(14, 2);call #Ultimate.allocInit(12, 3); {25001#true} is VALID [2022-04-28 09:17:13,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {25001#true} assume true; {25001#true} is VALID [2022-04-28 09:17:13,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25001#true} {25001#true} #42#return; {25001#true} is VALID [2022-04-28 09:17:13,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {25001#true} call #t~ret6 := main(); {25001#true} is VALID [2022-04-28 09:17:13,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {25001#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {25006#(= main_~x~0 0)} is VALID [2022-04-28 09:17:13,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {25006#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {25006#(= main_~x~0 0)} is VALID [2022-04-28 09:17:13,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {25006#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:13,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {25007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {25007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:13,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {25007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25008#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:13,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {25008#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25008#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:13,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {25008#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25009#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:13,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {25009#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {25009#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:13,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {25009#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25010#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:13,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {25010#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25010#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:13,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {25010#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:13,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {25011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:13,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {25011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:13,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {25012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:13,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {25012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25013#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:13,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {25013#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {25013#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:13,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {25013#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:13,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {25014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:13,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {25014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:13,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {25015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:13,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {25015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25016#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:13,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {25016#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25016#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:13,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {25016#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25017#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:13,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {25017#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {25017#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:13,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {25017#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:13,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {25018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:13,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {25018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:13,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {25019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:13,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {25019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25020#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:13,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {25020#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {25020#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:13,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {25020#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:13,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {25021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {25021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:13,020 INFO L290 TraceCheckUtils]: 37: Hoare triple {25021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:13,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {25022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:13,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {25022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25023#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:13,021 INFO L290 TraceCheckUtils]: 40: Hoare triple {25023#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25023#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:13,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {25023#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25024#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:13,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {25024#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25024#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:13,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {25024#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25025#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:13,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {25025#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25025#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:13,023 INFO L290 TraceCheckUtils]: 45: Hoare triple {25025#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25026#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:13,023 INFO L290 TraceCheckUtils]: 46: Hoare triple {25026#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25026#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:13,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {25026#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25027#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:13,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {25027#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25027#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:13,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {25027#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25028#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:13,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {25028#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {25028#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:13,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {25028#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25029#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:13,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {25029#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {25029#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:13,026 INFO L290 TraceCheckUtils]: 53: Hoare triple {25029#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25030#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:13,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {25030#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25030#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:13,027 INFO L290 TraceCheckUtils]: 55: Hoare triple {25030#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25031#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:13,027 INFO L290 TraceCheckUtils]: 56: Hoare triple {25031#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25031#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:13,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {25031#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25032#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:13,028 INFO L290 TraceCheckUtils]: 58: Hoare triple {25032#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25032#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:13,028 INFO L290 TraceCheckUtils]: 59: Hoare triple {25032#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25033#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:13,029 INFO L290 TraceCheckUtils]: 60: Hoare triple {25033#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25033#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:13,029 INFO L290 TraceCheckUtils]: 61: Hoare triple {25033#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25034#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:13,030 INFO L290 TraceCheckUtils]: 62: Hoare triple {25034#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {25034#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:13,030 INFO L290 TraceCheckUtils]: 63: Hoare triple {25034#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25035#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:13,030 INFO L290 TraceCheckUtils]: 64: Hoare triple {25035#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {25035#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:13,031 INFO L290 TraceCheckUtils]: 65: Hoare triple {25035#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25241#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:13,031 INFO L290 TraceCheckUtils]: 66: Hoare triple {25241#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {25241#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:13,032 INFO L290 TraceCheckUtils]: 67: Hoare triple {25241#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25248#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:13,032 INFO L290 TraceCheckUtils]: 68: Hoare triple {25248#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {25248#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:13,033 INFO L290 TraceCheckUtils]: 69: Hoare triple {25248#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25255#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:13,033 INFO L290 TraceCheckUtils]: 70: Hoare triple {25255#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {25255#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:13,033 INFO L290 TraceCheckUtils]: 71: Hoare triple {25255#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25262#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:13,034 INFO L290 TraceCheckUtils]: 72: Hoare triple {25262#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {25262#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:13,034 INFO L290 TraceCheckUtils]: 73: Hoare triple {25262#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25269#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:13,035 INFO L290 TraceCheckUtils]: 74: Hoare triple {25269#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {25269#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:13,035 INFO L290 TraceCheckUtils]: 75: Hoare triple {25269#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25276#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:13,035 INFO L290 TraceCheckUtils]: 76: Hoare triple {25276#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {25276#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:13,036 INFO L272 TraceCheckUtils]: 77: Hoare triple {25276#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {25283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:13,037 INFO L290 TraceCheckUtils]: 78: Hoare triple {25283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:13,037 INFO L290 TraceCheckUtils]: 79: Hoare triple {25287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25002#false} is VALID [2022-04-28 09:17:13,037 INFO L290 TraceCheckUtils]: 80: Hoare triple {25002#false} assume !false; {25002#false} is VALID [2022-04-28 09:17:13,037 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 09:17:13,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:13,571 INFO L290 TraceCheckUtils]: 80: Hoare triple {25002#false} assume !false; {25002#false} is VALID [2022-04-28 09:17:13,571 INFO L290 TraceCheckUtils]: 79: Hoare triple {25287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25002#false} is VALID [2022-04-28 09:17:13,571 INFO L290 TraceCheckUtils]: 78: Hoare triple {25283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:13,572 INFO L272 TraceCheckUtils]: 77: Hoare triple {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {25283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:13,572 INFO L290 TraceCheckUtils]: 76: Hoare triple {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:13,573 INFO L290 TraceCheckUtils]: 75: Hoare triple {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:13,573 INFO L290 TraceCheckUtils]: 74: Hoare triple {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:13,573 INFO L290 TraceCheckUtils]: 73: Hoare triple {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:13,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:13,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:13,575 INFO L290 TraceCheckUtils]: 70: Hoare triple {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:13,575 INFO L290 TraceCheckUtils]: 69: Hoare triple {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:13,575 INFO L290 TraceCheckUtils]: 68: Hoare triple {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:13,576 INFO L290 TraceCheckUtils]: 67: Hoare triple {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:13,576 INFO L290 TraceCheckUtils]: 66: Hoare triple {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:13,577 INFO L290 TraceCheckUtils]: 65: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25303#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:13,577 INFO L290 TraceCheckUtils]: 64: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,577 INFO L290 TraceCheckUtils]: 63: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,578 INFO L290 TraceCheckUtils]: 62: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,578 INFO L290 TraceCheckUtils]: 61: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,578 INFO L290 TraceCheckUtils]: 60: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,579 INFO L290 TraceCheckUtils]: 59: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,584 INFO L290 TraceCheckUtils]: 58: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,585 INFO L290 TraceCheckUtils]: 55: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,586 INFO L290 TraceCheckUtils]: 52: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,586 INFO L290 TraceCheckUtils]: 51: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {25340#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {25001#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {25340#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:13,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {25001#true} call #t~ret6 := main(); {25001#true} is VALID [2022-04-28 09:17:13,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25001#true} {25001#true} #42#return; {25001#true} is VALID [2022-04-28 09:17:13,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {25001#true} assume true; {25001#true} is VALID [2022-04-28 09:17:13,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {25001#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(14, 2);call #Ultimate.allocInit(12, 3); {25001#true} is VALID [2022-04-28 09:17:13,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {25001#true} call ULTIMATE.init(); {25001#true} is VALID [2022-04-28 09:17:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2022-04-28 09:17:13,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155744807] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:13,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:13,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40, 6] total 49 [2022-04-28 09:17:13,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:13,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [663749614] [2022-04-28 09:17:13,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [663749614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:13,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:13,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 09:17:13,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096791530] [2022-04-28 09:17:13,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:13,601 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 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 81 [2022-04-28 09:17:13,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:13,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:13,650 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 09:17:13,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 09:17:13,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:13,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 09:17:13,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2164, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 09:17:13,651 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:17,838 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-04-28 09:17:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 09:17:17,838 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 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 81 [2022-04-28 09:17:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 90 transitions. [2022-04-28 09:17:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 90 transitions. [2022-04-28 09:17:17,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 90 transitions. [2022-04-28 09:17:17,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:17,958 INFO L225 Difference]: With dead ends: 90 [2022-04-28 09:17:17,958 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 09:17:17,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=437, Invalid=6703, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 09:17:17,959 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 79 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2563 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:17,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 88 Invalid, 2636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2563 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 09:17:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 09:17:18,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-04-28 09:17:18,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:18,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 84 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:18,338 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 84 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:18,338 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 84 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:18,339 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2022-04-28 09:17:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2022-04-28 09:17:18,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:18,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:18,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 3 states have call successors, (3), 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 85 states. [2022-04-28 09:17:18,339 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 3 states have call successors, (3), 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 85 states. [2022-04-28 09:17:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:18,340 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2022-04-28 09:17:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2022-04-28 09:17:18,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:18,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:18,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:18,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2022-04-28 09:17:18,341 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2022-04-28 09:17:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:18,341 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2022-04-28 09:17:18,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:18,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 84 transitions. [2022-04-28 09:17:18,458 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 09:17:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2022-04-28 09:17:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 09:17:18,459 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:18,459 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:18,487 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 09:17:18,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:18,659 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:18,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:18,659 INFO L85 PathProgramCache]: Analyzing trace with hash -226943236, now seen corresponding path program 71 times [2022-04-28 09:17:18,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:18,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [122595413] [2022-04-28 09:17:18,662 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:18,662 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:18,662 INFO L85 PathProgramCache]: Analyzing trace with hash -226943236, now seen corresponding path program 72 times [2022-04-28 09:17:18,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:18,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945383114] [2022-04-28 09:17:18,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:19,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {26170#(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(14, 2);call #Ultimate.allocInit(12, 3); {26128#true} is VALID [2022-04-28 09:17:19,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {26128#true} assume true; {26128#true} is VALID [2022-04-28 09:17:19,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26128#true} {26128#true} #42#return; {26128#true} is VALID [2022-04-28 09:17:19,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {26128#true} call ULTIMATE.init(); {26170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:19,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {26170#(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(14, 2);call #Ultimate.allocInit(12, 3); {26128#true} is VALID [2022-04-28 09:17:19,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {26128#true} assume true; {26128#true} is VALID [2022-04-28 09:17:19,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26128#true} {26128#true} #42#return; {26128#true} is VALID [2022-04-28 09:17:19,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {26128#true} call #t~ret6 := main(); {26128#true} is VALID [2022-04-28 09:17:19,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {26128#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {26133#(= main_~x~0 0)} is VALID [2022-04-28 09:17:19,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {26133#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {26133#(= main_~x~0 0)} is VALID [2022-04-28 09:17:19,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {26133#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:19,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {26134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {26134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:19,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {26134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:19,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {26135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:19,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {26135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:19,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {26136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {26136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:19,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {26136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:19,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {26137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:19,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {26137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:19,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {26138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:19,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {26138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:19,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {26139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:19,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {26139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:19,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {26140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {26140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:19,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {26140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:19,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {26141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:19,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {26141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26142#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:19,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {26142#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26142#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:19,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {26142#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26143#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:19,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {26143#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26143#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:19,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {26143#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26144#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:19,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {26144#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {26144#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:19,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {26144#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26145#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:19,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {26145#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26145#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:19,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {26145#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26146#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:19,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {26146#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26146#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:19,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {26146#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26147#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:19,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {26147#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {26147#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:19,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {26147#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26148#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:19,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {26148#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {26148#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:19,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {26148#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26149#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:19,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {26149#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26149#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:19,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {26149#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26150#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:19,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {26150#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26150#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:19,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {26150#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26151#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:19,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {26151#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26151#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:19,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {26151#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26152#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:19,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {26152#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26152#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:19,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {26152#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26153#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:19,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {26153#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26153#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:19,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {26153#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26154#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:19,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {26154#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26154#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:19,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {26154#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26155#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:19,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {26155#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {26155#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:19,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {26155#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26156#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:19,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {26156#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {26156#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:19,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {26156#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26157#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:19,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {26157#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26157#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:19,240 INFO L290 TraceCheckUtils]: 55: Hoare triple {26157#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26158#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:19,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {26158#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26158#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:19,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {26158#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26159#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:19,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {26159#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26159#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:19,241 INFO L290 TraceCheckUtils]: 59: Hoare triple {26159#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26160#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:19,241 INFO L290 TraceCheckUtils]: 60: Hoare triple {26160#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26160#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:19,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {26160#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26161#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:19,242 INFO L290 TraceCheckUtils]: 62: Hoare triple {26161#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26161#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:19,242 INFO L290 TraceCheckUtils]: 63: Hoare triple {26161#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26162#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:19,242 INFO L290 TraceCheckUtils]: 64: Hoare triple {26162#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {26162#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:19,242 INFO L290 TraceCheckUtils]: 65: Hoare triple {26162#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26163#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:19,243 INFO L290 TraceCheckUtils]: 66: Hoare triple {26163#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26163#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:19,243 INFO L290 TraceCheckUtils]: 67: Hoare triple {26163#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26164#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:19,243 INFO L290 TraceCheckUtils]: 68: Hoare triple {26164#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {26164#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:19,244 INFO L290 TraceCheckUtils]: 69: Hoare triple {26164#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26165#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:19,244 INFO L290 TraceCheckUtils]: 70: Hoare triple {26165#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26165#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:19,244 INFO L290 TraceCheckUtils]: 71: Hoare triple {26165#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26166#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:19,244 INFO L290 TraceCheckUtils]: 72: Hoare triple {26166#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {26166#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:19,245 INFO L290 TraceCheckUtils]: 73: Hoare triple {26166#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26167#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:17:19,245 INFO L290 TraceCheckUtils]: 74: Hoare triple {26167#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26167#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:17:19,245 INFO L290 TraceCheckUtils]: 75: Hoare triple {26167#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26168#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:19,246 INFO L290 TraceCheckUtils]: 76: Hoare triple {26168#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26168#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:19,246 INFO L290 TraceCheckUtils]: 77: Hoare triple {26168#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26169#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:19,246 INFO L290 TraceCheckUtils]: 78: Hoare triple {26169#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 72))} assume !(~x~0 % 4294967296 < 99); {26129#false} is VALID [2022-04-28 09:17:19,246 INFO L272 TraceCheckUtils]: 79: Hoare triple {26129#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {26129#false} is VALID [2022-04-28 09:17:19,246 INFO L290 TraceCheckUtils]: 80: Hoare triple {26129#false} ~cond := #in~cond; {26129#false} is VALID [2022-04-28 09:17:19,247 INFO L290 TraceCheckUtils]: 81: Hoare triple {26129#false} assume 0 == ~cond; {26129#false} is VALID [2022-04-28 09:17:19,247 INFO L290 TraceCheckUtils]: 82: Hoare triple {26129#false} assume !false; {26129#false} is VALID [2022-04-28 09:17:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:19,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:19,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945383114] [2022-04-28 09:17:19,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945383114] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:19,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107104386] [2022-04-28 09:17:19,247 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:17:19,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:19,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:19,248 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 09:17:19,249 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 09:17:21,948 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2022-04-28 09:17:21,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:21,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-28 09:17:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:21,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:23,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {26128#true} call ULTIMATE.init(); {26128#true} is VALID [2022-04-28 09:17:23,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {26128#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(14, 2);call #Ultimate.allocInit(12, 3); {26128#true} is VALID [2022-04-28 09:17:23,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {26128#true} assume true; {26128#true} is VALID [2022-04-28 09:17:23,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26128#true} {26128#true} #42#return; {26128#true} is VALID [2022-04-28 09:17:23,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {26128#true} call #t~ret6 := main(); {26128#true} is VALID [2022-04-28 09:17:23,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {26128#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {26133#(= main_~x~0 0)} is VALID [2022-04-28 09:17:23,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {26133#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {26133#(= main_~x~0 0)} is VALID [2022-04-28 09:17:23,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {26133#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:23,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {26134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {26134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:23,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {26134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:23,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {26135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:23,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {26135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:23,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {26136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {26136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:23,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {26136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:23,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {26137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:23,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {26137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:23,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {26138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:23,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {26138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:23,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {26139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:23,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {26139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:23,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {26140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {26140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:23,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {26140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:23,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {26141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:23,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {26141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26142#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:23,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {26142#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26142#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:23,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {26142#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26143#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:23,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {26143#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26143#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:23,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {26143#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26144#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:23,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {26144#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {26144#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:23,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {26144#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26145#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:23,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {26145#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26145#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:23,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {26145#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26146#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:23,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {26146#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26146#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:23,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {26146#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26147#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:23,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {26147#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {26147#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:23,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {26147#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26148#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:23,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {26148#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {26148#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:23,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {26148#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26149#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:23,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {26149#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26149#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:23,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {26149#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26150#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:23,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {26150#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26150#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:23,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {26150#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26297#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {26297#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {26297#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {26297#(and (<= main_~x~0 36) (<= 36 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26304#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:23,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {26304#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26304#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:23,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {26304#(and (<= main_~x~0 38) (<= (mod main_~y~0 2) 0) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26311#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:23,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {26311#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26311#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:23,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {26311#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26318#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,106 INFO L290 TraceCheckUtils]: 48: Hoare triple {26318#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {26318#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,106 INFO L290 TraceCheckUtils]: 49: Hoare triple {26318#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26325#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:23,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {26325#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {26325#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:23,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {26325#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26332#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:23,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {26332#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {26332#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:23,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {26332#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26339#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:23,108 INFO L290 TraceCheckUtils]: 54: Hoare triple {26339#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26339#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:23,108 INFO L290 TraceCheckUtils]: 55: Hoare triple {26339#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26346#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {26346#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {26346#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,109 INFO L290 TraceCheckUtils]: 57: Hoare triple {26346#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26353#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {26353#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {26353#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,110 INFO L290 TraceCheckUtils]: 59: Hoare triple {26353#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26360#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:23,110 INFO L290 TraceCheckUtils]: 60: Hoare triple {26360#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26360#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:23,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {26360#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26367#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:23,111 INFO L290 TraceCheckUtils]: 62: Hoare triple {26367#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26367#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:23,111 INFO L290 TraceCheckUtils]: 63: Hoare triple {26367#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26374#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:23,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {26374#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {26374#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:23,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {26374#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26381#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {26381#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {26381#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,113 INFO L290 TraceCheckUtils]: 67: Hoare triple {26381#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26388#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:23,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {26388#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {26388#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:23,114 INFO L290 TraceCheckUtils]: 69: Hoare triple {26388#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26395#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {26395#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {26395#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {26395#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26402#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:23,115 INFO L290 TraceCheckUtils]: 72: Hoare triple {26402#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {26402#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:23,115 INFO L290 TraceCheckUtils]: 73: Hoare triple {26402#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26409#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,115 INFO L290 TraceCheckUtils]: 74: Hoare triple {26409#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {26409#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:23,116 INFO L290 TraceCheckUtils]: 75: Hoare triple {26409#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26416#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:23,116 INFO L290 TraceCheckUtils]: 76: Hoare triple {26416#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {26416#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:23,116 INFO L290 TraceCheckUtils]: 77: Hoare triple {26416#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26423#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:23,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {26423#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} assume !(~x~0 % 4294967296 < 99); {26423#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:23,117 INFO L272 TraceCheckUtils]: 79: Hoare triple {26423#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {26430#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:23,118 INFO L290 TraceCheckUtils]: 80: Hoare triple {26430#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26434#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:23,118 INFO L290 TraceCheckUtils]: 81: Hoare triple {26434#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26129#false} is VALID [2022-04-28 09:17:23,118 INFO L290 TraceCheckUtils]: 82: Hoare triple {26129#false} assume !false; {26129#false} is VALID [2022-04-28 09:17:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:23,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:23,559 INFO L290 TraceCheckUtils]: 82: Hoare triple {26129#false} assume !false; {26129#false} is VALID [2022-04-28 09:17:23,559 INFO L290 TraceCheckUtils]: 81: Hoare triple {26434#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26129#false} is VALID [2022-04-28 09:17:23,560 INFO L290 TraceCheckUtils]: 80: Hoare triple {26430#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26434#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:23,560 INFO L272 TraceCheckUtils]: 79: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {26430#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:23,560 INFO L290 TraceCheckUtils]: 78: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,561 INFO L290 TraceCheckUtils]: 77: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,561 INFO L290 TraceCheckUtils]: 76: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,562 INFO L290 TraceCheckUtils]: 75: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,562 INFO L290 TraceCheckUtils]: 74: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,562 INFO L290 TraceCheckUtils]: 73: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,562 INFO L290 TraceCheckUtils]: 72: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,563 INFO L290 TraceCheckUtils]: 71: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,563 INFO L290 TraceCheckUtils]: 70: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,563 INFO L290 TraceCheckUtils]: 69: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,564 INFO L290 TraceCheckUtils]: 68: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,564 INFO L290 TraceCheckUtils]: 67: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,564 INFO L290 TraceCheckUtils]: 66: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,565 INFO L290 TraceCheckUtils]: 65: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,565 INFO L290 TraceCheckUtils]: 64: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,565 INFO L290 TraceCheckUtils]: 63: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,566 INFO L290 TraceCheckUtils]: 62: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,566 INFO L290 TraceCheckUtils]: 60: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,567 INFO L290 TraceCheckUtils]: 59: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,568 INFO L290 TraceCheckUtils]: 56: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,568 INFO L290 TraceCheckUtils]: 55: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,568 INFO L290 TraceCheckUtils]: 54: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,570 INFO L290 TraceCheckUtils]: 50: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,571 INFO L290 TraceCheckUtils]: 47: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,571 INFO L290 TraceCheckUtils]: 46: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26450#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:23,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {26565#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {26128#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {26565#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:23,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {26128#true} call #t~ret6 := main(); {26128#true} is VALID [2022-04-28 09:17:23,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26128#true} {26128#true} #42#return; {26128#true} is VALID [2022-04-28 09:17:23,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {26128#true} assume true; {26128#true} is VALID [2022-04-28 09:17:23,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {26128#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(14, 2);call #Ultimate.allocInit(12, 3); {26128#true} is VALID [2022-04-28 09:17:23,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {26128#true} call ULTIMATE.init(); {26128#true} is VALID [2022-04-28 09:17:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2022-04-28 09:17:23,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107104386] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:23,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:23,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41, 6] total 63 [2022-04-28 09:17:23,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:23,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [122595413] [2022-04-28 09:17:23,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [122595413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:23,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:23,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 09:17:23,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770238740] [2022-04-28 09:17:23,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:23,592 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 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 83 [2022-04-28 09:17:23,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:23,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:23,650 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 09:17:23,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 09:17:23,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:23,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 09:17:23,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3636, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 09:17:23,651 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:28,194 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-04-28 09:17:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 09:17:28,194 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 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 83 [2022-04-28 09:17:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 92 transitions. [2022-04-28 09:17:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 92 transitions. [2022-04-28 09:17:28,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 92 transitions. [2022-04-28 09:17:28,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:28,267 INFO L225 Difference]: With dead ends: 92 [2022-04-28 09:17:28,267 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 09:17:28,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=526, Invalid=9374, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 09:17:28,268 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:28,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 83 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 09:17:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 09:17:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-04-28 09:17:28,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:28,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 86 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 81 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:28,648 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 86 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 81 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:28,648 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 86 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 81 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:28,648 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2022-04-28 09:17:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-04-28 09:17:28,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:28,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:28,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 81 states have internal predecessors, (82), 3 states have call successors, (3), 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 87 states. [2022-04-28 09:17:28,649 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 81 states have internal predecessors, (82), 3 states have call successors, (3), 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 87 states. [2022-04-28 09:17:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:28,650 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2022-04-28 09:17:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-04-28 09:17:28,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:28,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:28,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:28,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0123456790123457) internal successors, (82), 81 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2022-04-28 09:17:28,651 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2022-04-28 09:17:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:28,651 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2022-04-28 09:17:28,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:28,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 86 transitions. [2022-04-28 09:17:28,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-04-28 09:17:28,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 09:17:28,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:28,768 INFO L195 NwaCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:28,775 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 09:17:28,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:28,973 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:28,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1992848505, now seen corresponding path program 73 times [2022-04-28 09:17:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:28,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302640000] [2022-04-28 09:17:28,975 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:28,975 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1992848505, now seen corresponding path program 74 times [2022-04-28 09:17:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:28,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570037470] [2022-04-28 09:17:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:29,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:29,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {27338#(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(14, 2);call #Ultimate.allocInit(12, 3); {27295#true} is VALID [2022-04-28 09:17:29,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {27295#true} assume true; {27295#true} is VALID [2022-04-28 09:17:29,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27295#true} {27295#true} #42#return; {27295#true} is VALID [2022-04-28 09:17:29,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {27295#true} call ULTIMATE.init(); {27338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:29,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {27338#(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(14, 2);call #Ultimate.allocInit(12, 3); {27295#true} is VALID [2022-04-28 09:17:29,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {27295#true} assume true; {27295#true} is VALID [2022-04-28 09:17:29,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27295#true} {27295#true} #42#return; {27295#true} is VALID [2022-04-28 09:17:29,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {27295#true} call #t~ret6 := main(); {27295#true} is VALID [2022-04-28 09:17:29,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {27295#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {27300#(= main_~x~0 0)} is VALID [2022-04-28 09:17:29,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {27300#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {27300#(= main_~x~0 0)} is VALID [2022-04-28 09:17:29,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {27300#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27301#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:29,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {27301#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {27301#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:29,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {27301#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27302#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:29,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {27302#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27302#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:29,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {27302#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27303#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:29,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {27303#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {27303#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:29,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {27303#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27304#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:29,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {27304#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27304#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:29,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {27304#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27305#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:29,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {27305#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27305#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:29,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {27305#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27306#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:29,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {27306#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27306#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:29,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {27306#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27307#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:29,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {27307#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {27307#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:29,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {27307#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27308#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:29,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {27308#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27308#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:29,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {27308#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27309#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:29,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {27309#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27309#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:29,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {27309#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27310#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:29,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {27310#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27310#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:29,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {27310#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27311#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:29,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {27311#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {27311#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:29,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {27311#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27312#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:29,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {27312#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27312#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:29,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {27312#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27313#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:29,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {27313#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27313#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:29,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {27313#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27314#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:29,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {27314#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {27314#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:29,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {27314#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27315#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:29,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {27315#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {27315#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:29,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {27315#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27316#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:29,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {27316#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27316#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:29,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {27316#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27317#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:29,653 INFO L290 TraceCheckUtils]: 40: Hoare triple {27317#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27317#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:29,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {27317#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27318#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:29,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {27318#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27318#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:29,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {27318#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27319#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:29,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {27319#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27319#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:29,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {27319#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27320#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:29,655 INFO L290 TraceCheckUtils]: 46: Hoare triple {27320#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27320#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:29,655 INFO L290 TraceCheckUtils]: 47: Hoare triple {27320#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27321#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:29,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {27321#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27321#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:29,656 INFO L290 TraceCheckUtils]: 49: Hoare triple {27321#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27322#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:29,656 INFO L290 TraceCheckUtils]: 50: Hoare triple {27322#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {27322#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:29,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {27322#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27323#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:29,657 INFO L290 TraceCheckUtils]: 52: Hoare triple {27323#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {27323#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:29,657 INFO L290 TraceCheckUtils]: 53: Hoare triple {27323#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27324#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:29,657 INFO L290 TraceCheckUtils]: 54: Hoare triple {27324#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27324#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:29,657 INFO L290 TraceCheckUtils]: 55: Hoare triple {27324#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27325#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:29,658 INFO L290 TraceCheckUtils]: 56: Hoare triple {27325#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27325#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:29,658 INFO L290 TraceCheckUtils]: 57: Hoare triple {27325#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27326#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:29,658 INFO L290 TraceCheckUtils]: 58: Hoare triple {27326#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27326#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:29,659 INFO L290 TraceCheckUtils]: 59: Hoare triple {27326#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27327#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:29,659 INFO L290 TraceCheckUtils]: 60: Hoare triple {27327#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27327#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:29,659 INFO L290 TraceCheckUtils]: 61: Hoare triple {27327#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27328#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:29,659 INFO L290 TraceCheckUtils]: 62: Hoare triple {27328#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27328#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:29,660 INFO L290 TraceCheckUtils]: 63: Hoare triple {27328#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27329#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:29,660 INFO L290 TraceCheckUtils]: 64: Hoare triple {27329#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {27329#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:29,660 INFO L290 TraceCheckUtils]: 65: Hoare triple {27329#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27330#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:29,661 INFO L290 TraceCheckUtils]: 66: Hoare triple {27330#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27330#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:29,661 INFO L290 TraceCheckUtils]: 67: Hoare triple {27330#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27331#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:29,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {27331#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {27331#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:29,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {27331#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27332#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:29,662 INFO L290 TraceCheckUtils]: 70: Hoare triple {27332#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27332#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:29,662 INFO L290 TraceCheckUtils]: 71: Hoare triple {27332#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27333#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:29,662 INFO L290 TraceCheckUtils]: 72: Hoare triple {27333#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {27333#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:29,663 INFO L290 TraceCheckUtils]: 73: Hoare triple {27333#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27334#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:17:29,663 INFO L290 TraceCheckUtils]: 74: Hoare triple {27334#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27334#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:17:29,663 INFO L290 TraceCheckUtils]: 75: Hoare triple {27334#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27335#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:29,663 INFO L290 TraceCheckUtils]: 76: Hoare triple {27335#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27335#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:29,664 INFO L290 TraceCheckUtils]: 77: Hoare triple {27335#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27336#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:29,664 INFO L290 TraceCheckUtils]: 78: Hoare triple {27336#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {27336#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:29,664 INFO L290 TraceCheckUtils]: 79: Hoare triple {27336#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27337#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 74))} is VALID [2022-04-28 09:17:29,665 INFO L290 TraceCheckUtils]: 80: Hoare triple {27337#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 74))} assume !(~x~0 % 4294967296 < 99); {27296#false} is VALID [2022-04-28 09:17:29,665 INFO L272 TraceCheckUtils]: 81: Hoare triple {27296#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27296#false} is VALID [2022-04-28 09:17:29,665 INFO L290 TraceCheckUtils]: 82: Hoare triple {27296#false} ~cond := #in~cond; {27296#false} is VALID [2022-04-28 09:17:29,665 INFO L290 TraceCheckUtils]: 83: Hoare triple {27296#false} assume 0 == ~cond; {27296#false} is VALID [2022-04-28 09:17:29,665 INFO L290 TraceCheckUtils]: 84: Hoare triple {27296#false} assume !false; {27296#false} is VALID [2022-04-28 09:17:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:29,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:29,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570037470] [2022-04-28 09:17:29,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570037470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:29,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489379993] [2022-04-28 09:17:29,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:17:29,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:29,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:29,667 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 09:17:29,668 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 09:17:29,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:17:29,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:29,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-28 09:17:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:29,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:31,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {27295#true} call ULTIMATE.init(); {27295#true} is VALID [2022-04-28 09:17:31,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {27295#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(14, 2);call #Ultimate.allocInit(12, 3); {27295#true} is VALID [2022-04-28 09:17:31,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {27295#true} assume true; {27295#true} is VALID [2022-04-28 09:17:31,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27295#true} {27295#true} #42#return; {27295#true} is VALID [2022-04-28 09:17:31,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {27295#true} call #t~ret6 := main(); {27295#true} is VALID [2022-04-28 09:17:31,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {27295#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {27300#(= main_~x~0 0)} is VALID [2022-04-28 09:17:31,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {27300#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {27300#(= main_~x~0 0)} is VALID [2022-04-28 09:17:31,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {27300#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27363#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {27363#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27363#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {27363#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27370#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-28 09:17:31,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {27370#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {27370#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-28 09:17:31,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {27370#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27377#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:17:31,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {27377#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {27377#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:17:31,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {27377#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27384#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:17:31,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {27384#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {27384#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-28 09:17:31,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {27384#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27391#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {27391#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27391#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {27391#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27398#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {27398#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27398#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {27398#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27405#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {27405#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27405#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {27405#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27412#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {27412#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27412#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {27412#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27419#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {27419#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27419#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {27419#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27426#(and (= 18 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {27426#(and (= 18 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27426#(and (= 18 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {27426#(and (= 18 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27433#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {27433#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27433#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {27433#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27440#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {27440#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27440#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {27440#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27447#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:17:31,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {27447#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 99); {27447#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:17:31,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {27447#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27454#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {27454#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27454#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {27454#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27461#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:17:31,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {27461#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27461#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:17:31,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {27461#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27468#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:17:31,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {27468#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {27468#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:17:31,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {27468#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27475#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:17:31,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {27475#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {27475#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:17:31,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {27475#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27482#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {27482#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27482#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {27482#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27489#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {27489#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27489#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {27489#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27496#(and (<= (mod main_~y~0 2) 0) (= 38 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:17:31,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {27496#(and (<= (mod main_~y~0 2) 0) (= 38 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {27496#(and (<= (mod main_~y~0 2) 0) (= 38 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:17:31,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {27496#(and (<= (mod main_~y~0 2) 0) (= 38 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27503#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:17:31,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {27503#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27503#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:17:31,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {27503#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27510#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:17:31,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {27510#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {27510#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:17:31,062 INFO L290 TraceCheckUtils]: 51: Hoare triple {27510#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27517#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:17:31,062 INFO L290 TraceCheckUtils]: 52: Hoare triple {27517#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {27517#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:17:31,062 INFO L290 TraceCheckUtils]: 53: Hoare triple {27517#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27524#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:17:31,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {27524#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {27524#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:17:31,063 INFO L290 TraceCheckUtils]: 55: Hoare triple {27524#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27531#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,063 INFO L290 TraceCheckUtils]: 56: Hoare triple {27531#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27531#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {27531#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27538#(and (= (+ (- 2) main_~x~0) 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {27538#(and (= (+ (- 2) main_~x~0) 50) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27538#(and (= (+ (- 2) main_~x~0) 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,064 INFO L290 TraceCheckUtils]: 59: Hoare triple {27538#(and (= (+ (- 2) main_~x~0) 50) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27545#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 50))} is VALID [2022-04-28 09:17:31,064 INFO L290 TraceCheckUtils]: 60: Hoare triple {27545#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 50))} assume !!(~x~0 % 4294967296 < 99); {27545#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 50))} is VALID [2022-04-28 09:17:31,064 INFO L290 TraceCheckUtils]: 61: Hoare triple {27545#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 50))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27552#(and (<= (mod main_~y~0 2) 0) (= 56 main_~x~0))} is VALID [2022-04-28 09:17:31,064 INFO L290 TraceCheckUtils]: 62: Hoare triple {27552#(and (<= (mod main_~y~0 2) 0) (= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27552#(and (<= (mod main_~y~0 2) 0) (= 56 main_~x~0))} is VALID [2022-04-28 09:17:31,065 INFO L290 TraceCheckUtils]: 63: Hoare triple {27552#(and (<= (mod main_~y~0 2) 0) (= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27559#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,065 INFO L290 TraceCheckUtils]: 64: Hoare triple {27559#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27559#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,065 INFO L290 TraceCheckUtils]: 65: Hoare triple {27559#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27566#(and (= main_~x~0 60) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,065 INFO L290 TraceCheckUtils]: 66: Hoare triple {27566#(and (= main_~x~0 60) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27566#(and (= main_~x~0 60) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,066 INFO L290 TraceCheckUtils]: 67: Hoare triple {27566#(and (= main_~x~0 60) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27573#(and (= 60 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,066 INFO L290 TraceCheckUtils]: 68: Hoare triple {27573#(and (= 60 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27573#(and (= 60 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,066 INFO L290 TraceCheckUtils]: 69: Hoare triple {27573#(and (= 60 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27580#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} is VALID [2022-04-28 09:17:31,066 INFO L290 TraceCheckUtils]: 70: Hoare triple {27580#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27580#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} is VALID [2022-04-28 09:17:31,067 INFO L290 TraceCheckUtils]: 71: Hoare triple {27580#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27587#(and (<= (mod main_~y~0 2) 0) (= 66 main_~x~0))} is VALID [2022-04-28 09:17:31,067 INFO L290 TraceCheckUtils]: 72: Hoare triple {27587#(and (<= (mod main_~y~0 2) 0) (= 66 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27587#(and (<= (mod main_~y~0 2) 0) (= 66 main_~x~0))} is VALID [2022-04-28 09:17:31,067 INFO L290 TraceCheckUtils]: 73: Hoare triple {27587#(and (<= (mod main_~y~0 2) 0) (= 66 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27594#(and (<= (mod main_~y~0 2) 0) (= 68 main_~x~0))} is VALID [2022-04-28 09:17:31,067 INFO L290 TraceCheckUtils]: 74: Hoare triple {27594#(and (<= (mod main_~y~0 2) 0) (= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {27594#(and (<= (mod main_~y~0 2) 0) (= 68 main_~x~0))} is VALID [2022-04-28 09:17:31,068 INFO L290 TraceCheckUtils]: 75: Hoare triple {27594#(and (<= (mod main_~y~0 2) 0) (= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27601#(and (= 68 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,068 INFO L290 TraceCheckUtils]: 76: Hoare triple {27601#(and (= 68 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27601#(and (= 68 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,068 INFO L290 TraceCheckUtils]: 77: Hoare triple {27601#(and (= 68 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27608#(and (= 72 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,068 INFO L290 TraceCheckUtils]: 78: Hoare triple {27608#(and (= 72 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {27608#(and (= 72 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:31,069 INFO L290 TraceCheckUtils]: 79: Hoare triple {27608#(and (= 72 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27615#(and (<= (mod main_~y~0 2) 0) (= 72 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:17:31,069 INFO L290 TraceCheckUtils]: 80: Hoare triple {27615#(and (<= (mod main_~y~0 2) 0) (= 72 (+ (- 2) main_~x~0)))} assume !(~x~0 % 4294967296 < 99); {27615#(and (<= (mod main_~y~0 2) 0) (= 72 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:17:31,069 INFO L272 TraceCheckUtils]: 81: Hoare triple {27615#(and (<= (mod main_~y~0 2) 0) (= 72 (+ (- 2) main_~x~0)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27622#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:31,070 INFO L290 TraceCheckUtils]: 82: Hoare triple {27622#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27626#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:31,070 INFO L290 TraceCheckUtils]: 83: Hoare triple {27626#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27296#false} is VALID [2022-04-28 09:17:31,070 INFO L290 TraceCheckUtils]: 84: Hoare triple {27296#false} assume !false; {27296#false} is VALID [2022-04-28 09:17:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:31,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:31,439 INFO L290 TraceCheckUtils]: 84: Hoare triple {27296#false} assume !false; {27296#false} is VALID [2022-04-28 09:17:31,440 INFO L290 TraceCheckUtils]: 83: Hoare triple {27626#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27296#false} is VALID [2022-04-28 09:17:31,440 INFO L290 TraceCheckUtils]: 82: Hoare triple {27622#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27626#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:31,440 INFO L272 TraceCheckUtils]: 81: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27622#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:31,440 INFO L290 TraceCheckUtils]: 80: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,441 INFO L290 TraceCheckUtils]: 79: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,441 INFO L290 TraceCheckUtils]: 78: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,441 INFO L290 TraceCheckUtils]: 77: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,442 INFO L290 TraceCheckUtils]: 76: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,442 INFO L290 TraceCheckUtils]: 75: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,442 INFO L290 TraceCheckUtils]: 74: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,442 INFO L290 TraceCheckUtils]: 73: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,443 INFO L290 TraceCheckUtils]: 72: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,443 INFO L290 TraceCheckUtils]: 70: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,444 INFO L290 TraceCheckUtils]: 69: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,444 INFO L290 TraceCheckUtils]: 68: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,444 INFO L290 TraceCheckUtils]: 67: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,444 INFO L290 TraceCheckUtils]: 66: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,445 INFO L290 TraceCheckUtils]: 65: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,445 INFO L290 TraceCheckUtils]: 64: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,445 INFO L290 TraceCheckUtils]: 63: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,446 INFO L290 TraceCheckUtils]: 61: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,446 INFO L290 TraceCheckUtils]: 60: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,446 INFO L290 TraceCheckUtils]: 59: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,447 INFO L290 TraceCheckUtils]: 58: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,448 INFO L290 TraceCheckUtils]: 54: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,448 INFO L290 TraceCheckUtils]: 52: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,449 INFO L290 TraceCheckUtils]: 51: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,449 INFO L290 TraceCheckUtils]: 50: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,449 INFO L290 TraceCheckUtils]: 49: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {27865#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {27642#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:31,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {27865#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {27865#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:31,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {27295#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {27865#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:31,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {27295#true} call #t~ret6 := main(); {27295#true} is VALID [2022-04-28 09:17:31,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27295#true} {27295#true} #42#return; {27295#true} is VALID [2022-04-28 09:17:31,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {27295#true} assume true; {27295#true} is VALID [2022-04-28 09:17:31,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {27295#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(14, 2);call #Ultimate.allocInit(12, 3); {27295#true} is VALID [2022-04-28 09:17:31,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {27295#true} call ULTIMATE.init(); {27295#true} is VALID [2022-04-28 09:17:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2022-04-28 09:17:31,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489379993] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:31,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:31,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 6] total 82 [2022-04-28 09:17:31,463 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:31,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302640000] [2022-04-28 09:17:31,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302640000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:31,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:31,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 09:17:31,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935052998] [2022-04-28 09:17:31,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:31,463 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 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 85 [2022-04-28 09:17:31,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:31,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:31,500 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 09:17:31,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 09:17:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:31,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 09:17:31,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=6260, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 09:17:31,501 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:35,694 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2022-04-28 09:17:35,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 09:17:35,695 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 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 85 [2022-04-28 09:17:35,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 94 transitions. [2022-04-28 09:17:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 94 transitions. [2022-04-28 09:17:35,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 94 transitions. [2022-04-28 09:17:35,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:35,748 INFO L225 Difference]: With dead ends: 94 [2022-04-28 09:17:35,748 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 09:17:35,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3000 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=645, Invalid=13635, Unknown=0, NotChecked=0, Total=14280 [2022-04-28 09:17:35,750 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 83 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2843 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:35,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 78 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2843 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 09:17:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 09:17:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-04-28 09:17:36,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:36,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 88 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 83 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:36,049 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 88 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 83 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:36,049 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 88 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 83 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:36,050 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2022-04-28 09:17:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-04-28 09:17:36,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:36,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:36,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 83 states have internal predecessors, (84), 3 states have call successors, (3), 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 89 states. [2022-04-28 09:17:36,050 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 83 states have internal predecessors, (84), 3 states have call successors, (3), 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 89 states. [2022-04-28 09:17:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:36,051 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2022-04-28 09:17:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-04-28 09:17:36,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:36,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:36,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:36,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0120481927710843) internal successors, (84), 83 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2022-04-28 09:17:36,052 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2022-04-28 09:17:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:36,052 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2022-04-28 09:17:36,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:36,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 88 transitions. [2022-04-28 09:17:36,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2022-04-28 09:17:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 09:17:36,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:36,163 INFO L195 NwaCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:36,179 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 09:17:36,371 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,SelfDestructingSolverStorable46 [2022-04-28 09:17:36,371 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:36,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:36,372 INFO L85 PathProgramCache]: Analyzing trace with hash 613965494, now seen corresponding path program 75 times [2022-04-28 09:17:36,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:36,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1030986134] [2022-04-28 09:17:36,374 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:36,374 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:36,375 INFO L85 PathProgramCache]: Analyzing trace with hash 613965494, now seen corresponding path program 76 times [2022-04-28 09:17:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:36,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729679630] [2022-04-28 09:17:36,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:37,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:37,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {28551#(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(14, 2);call #Ultimate.allocInit(12, 3); {28507#true} is VALID [2022-04-28 09:17:37,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {28507#true} assume true; {28507#true} is VALID [2022-04-28 09:17:37,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28507#true} {28507#true} #42#return; {28507#true} is VALID [2022-04-28 09:17:37,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {28507#true} call ULTIMATE.init(); {28551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:37,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {28551#(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(14, 2);call #Ultimate.allocInit(12, 3); {28507#true} is VALID [2022-04-28 09:17:37,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {28507#true} assume true; {28507#true} is VALID [2022-04-28 09:17:37,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28507#true} {28507#true} #42#return; {28507#true} is VALID [2022-04-28 09:17:37,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {28507#true} call #t~ret6 := main(); {28507#true} is VALID [2022-04-28 09:17:37,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {28507#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {28512#(= main_~x~0 0)} is VALID [2022-04-28 09:17:37,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {28512#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {28512#(= main_~x~0 0)} is VALID [2022-04-28 09:17:37,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {28512#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:37,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {28513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {28513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:37,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {28513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28514#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:37,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {28514#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28514#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:37,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {28514#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:37,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {28515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {28515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:37,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {28515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28516#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:37,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {28516#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28516#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:37,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {28516#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:37,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {28517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:37,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {28517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28518#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:37,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {28518#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28518#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:37,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {28518#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28519#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:37,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {28519#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {28519#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:37,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {28519#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28520#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:37,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {28520#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28520#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:37,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {28520#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28521#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:37,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {28521#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28521#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:37,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {28521#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28522#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:37,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {28522#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28522#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:37,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {28522#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28523#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:37,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {28523#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {28523#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:37,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {28523#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28524#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:37,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {28524#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28524#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:37,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {28524#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28525#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:37,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {28525#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28525#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:37,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {28525#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28526#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:37,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {28526#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {28526#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:37,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {28526#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28527#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:37,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {28527#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {28527#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:37,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {28527#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28528#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:37,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {28528#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28528#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:37,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {28528#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28529#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:37,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {28529#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28529#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:37,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {28529#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28530#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:37,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {28530#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28530#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:37,250 INFO L290 TraceCheckUtils]: 43: Hoare triple {28530#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28531#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:37,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {28531#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28531#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:37,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {28531#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28532#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:37,251 INFO L290 TraceCheckUtils]: 46: Hoare triple {28532#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28532#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:37,251 INFO L290 TraceCheckUtils]: 47: Hoare triple {28532#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28533#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:37,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {28533#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28533#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:37,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {28533#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28534#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:37,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {28534#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {28534#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:37,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {28534#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28535#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:37,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {28535#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {28535#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:37,254 INFO L290 TraceCheckUtils]: 53: Hoare triple {28535#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28536#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:37,254 INFO L290 TraceCheckUtils]: 54: Hoare triple {28536#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28536#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:37,254 INFO L290 TraceCheckUtils]: 55: Hoare triple {28536#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28537#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:37,255 INFO L290 TraceCheckUtils]: 56: Hoare triple {28537#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28537#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:37,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {28537#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28538#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:37,256 INFO L290 TraceCheckUtils]: 58: Hoare triple {28538#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28538#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:37,256 INFO L290 TraceCheckUtils]: 59: Hoare triple {28538#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28539#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:37,256 INFO L290 TraceCheckUtils]: 60: Hoare triple {28539#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28539#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:37,257 INFO L290 TraceCheckUtils]: 61: Hoare triple {28539#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28540#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:37,257 INFO L290 TraceCheckUtils]: 62: Hoare triple {28540#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28540#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:37,258 INFO L290 TraceCheckUtils]: 63: Hoare triple {28540#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28541#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:37,258 INFO L290 TraceCheckUtils]: 64: Hoare triple {28541#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {28541#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:37,258 INFO L290 TraceCheckUtils]: 65: Hoare triple {28541#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28542#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:37,259 INFO L290 TraceCheckUtils]: 66: Hoare triple {28542#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28542#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:37,259 INFO L290 TraceCheckUtils]: 67: Hoare triple {28542#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28543#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:37,260 INFO L290 TraceCheckUtils]: 68: Hoare triple {28543#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {28543#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:37,260 INFO L290 TraceCheckUtils]: 69: Hoare triple {28543#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28544#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:37,260 INFO L290 TraceCheckUtils]: 70: Hoare triple {28544#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28544#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:37,261 INFO L290 TraceCheckUtils]: 71: Hoare triple {28544#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28545#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:37,261 INFO L290 TraceCheckUtils]: 72: Hoare triple {28545#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {28545#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:37,262 INFO L290 TraceCheckUtils]: 73: Hoare triple {28545#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28546#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:17:37,262 INFO L290 TraceCheckUtils]: 74: Hoare triple {28546#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28546#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:17:37,262 INFO L290 TraceCheckUtils]: 75: Hoare triple {28546#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28547#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:37,263 INFO L290 TraceCheckUtils]: 76: Hoare triple {28547#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28547#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:37,263 INFO L290 TraceCheckUtils]: 77: Hoare triple {28547#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28548#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:37,263 INFO L290 TraceCheckUtils]: 78: Hoare triple {28548#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {28548#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:37,264 INFO L290 TraceCheckUtils]: 79: Hoare triple {28548#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28549#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:17:37,264 INFO L290 TraceCheckUtils]: 80: Hoare triple {28549#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {28549#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:17:37,265 INFO L290 TraceCheckUtils]: 81: Hoare triple {28549#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28550#(and (<= main_~x~0 76) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:17:37,265 INFO L290 TraceCheckUtils]: 82: Hoare triple {28550#(and (<= main_~x~0 76) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {28508#false} is VALID [2022-04-28 09:17:37,265 INFO L272 TraceCheckUtils]: 83: Hoare triple {28508#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {28508#false} is VALID [2022-04-28 09:17:37,265 INFO L290 TraceCheckUtils]: 84: Hoare triple {28508#false} ~cond := #in~cond; {28508#false} is VALID [2022-04-28 09:17:37,265 INFO L290 TraceCheckUtils]: 85: Hoare triple {28508#false} assume 0 == ~cond; {28508#false} is VALID [2022-04-28 09:17:37,265 INFO L290 TraceCheckUtils]: 86: Hoare triple {28508#false} assume !false; {28508#false} is VALID [2022-04-28 09:17:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:37,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729679630] [2022-04-28 09:17:37,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729679630] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:37,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541662931] [2022-04-28 09:17:37,266 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:17:37,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:37,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:37,267 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 09:17:37,269 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 09:17:37,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:17:37,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:37,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 82 conjunts are in the unsatisfiable core [2022-04-28 09:17:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:37,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:38,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {28507#true} call ULTIMATE.init(); {28507#true} is VALID [2022-04-28 09:17:38,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {28507#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(14, 2);call #Ultimate.allocInit(12, 3); {28507#true} is VALID [2022-04-28 09:17:38,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {28507#true} assume true; {28507#true} is VALID [2022-04-28 09:17:38,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28507#true} {28507#true} #42#return; {28507#true} is VALID [2022-04-28 09:17:38,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {28507#true} call #t~ret6 := main(); {28507#true} is VALID [2022-04-28 09:17:38,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {28507#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {28512#(= main_~x~0 0)} is VALID [2022-04-28 09:17:38,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {28512#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {28512#(= main_~x~0 0)} is VALID [2022-04-28 09:17:38,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {28512#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:38,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {28513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {28513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:38,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {28513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28514#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:38,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {28514#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28514#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:38,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {28514#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:38,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {28515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {28515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:38,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {28515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28516#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:38,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {28516#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28516#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:38,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {28516#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:38,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {28517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:38,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {28517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28518#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:38,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {28518#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28518#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:38,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {28518#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28519#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:38,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {28519#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {28519#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:38,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {28519#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28520#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:38,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {28520#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28520#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:38,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {28520#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28521#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:38,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {28521#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28521#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:38,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {28521#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28522#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:38,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {28522#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28522#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:38,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {28522#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28523#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:38,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {28523#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {28523#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:38,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {28523#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28524#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:38,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {28524#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28524#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:38,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {28524#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28525#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:38,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {28525#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28525#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:38,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {28525#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28526#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:38,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {28526#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {28526#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:38,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {28526#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28527#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:38,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {28527#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {28527#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:38,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {28527#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28528#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:38,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {28528#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28528#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:38,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {28528#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28529#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:38,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {28529#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28529#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:38,344 INFO L290 TraceCheckUtils]: 41: Hoare triple {28529#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28530#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:38,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {28530#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28530#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:38,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {28530#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28531#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:38,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {28531#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28531#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:38,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {28531#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28532#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:38,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {28532#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28532#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:38,346 INFO L290 TraceCheckUtils]: 47: Hoare triple {28532#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28533#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:38,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {28533#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28533#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:38,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {28533#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28534#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:38,347 INFO L290 TraceCheckUtils]: 50: Hoare triple {28534#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {28534#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:38,347 INFO L290 TraceCheckUtils]: 51: Hoare triple {28534#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28535#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:38,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {28535#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {28535#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:38,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {28535#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28536#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:38,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {28536#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28536#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:38,348 INFO L290 TraceCheckUtils]: 55: Hoare triple {28536#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28537#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:38,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {28537#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28537#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:38,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {28537#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28538#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:38,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {28538#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28538#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:38,350 INFO L290 TraceCheckUtils]: 59: Hoare triple {28538#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28539#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:38,350 INFO L290 TraceCheckUtils]: 60: Hoare triple {28539#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28539#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:38,350 INFO L290 TraceCheckUtils]: 61: Hoare triple {28539#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28540#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:38,350 INFO L290 TraceCheckUtils]: 62: Hoare triple {28540#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28540#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:38,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {28540#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28541#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:38,351 INFO L290 TraceCheckUtils]: 64: Hoare triple {28541#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {28541#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:38,351 INFO L290 TraceCheckUtils]: 65: Hoare triple {28541#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28750#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:38,352 INFO L290 TraceCheckUtils]: 66: Hoare triple {28750#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {28750#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:38,352 INFO L290 TraceCheckUtils]: 67: Hoare triple {28750#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28757#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:38,352 INFO L290 TraceCheckUtils]: 68: Hoare triple {28757#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {28757#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:38,353 INFO L290 TraceCheckUtils]: 69: Hoare triple {28757#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28764#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:38,353 INFO L290 TraceCheckUtils]: 70: Hoare triple {28764#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {28764#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:38,353 INFO L290 TraceCheckUtils]: 71: Hoare triple {28764#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28771#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:38,353 INFO L290 TraceCheckUtils]: 72: Hoare triple {28771#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {28771#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:38,354 INFO L290 TraceCheckUtils]: 73: Hoare triple {28771#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28778#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:38,354 INFO L290 TraceCheckUtils]: 74: Hoare triple {28778#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {28778#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:38,354 INFO L290 TraceCheckUtils]: 75: Hoare triple {28778#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28785#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:38,355 INFO L290 TraceCheckUtils]: 76: Hoare triple {28785#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {28785#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:38,355 INFO L290 TraceCheckUtils]: 77: Hoare triple {28785#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28792#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:38,355 INFO L290 TraceCheckUtils]: 78: Hoare triple {28792#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {28792#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:38,356 INFO L290 TraceCheckUtils]: 79: Hoare triple {28792#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28799#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} is VALID [2022-04-28 09:17:38,356 INFO L290 TraceCheckUtils]: 80: Hoare triple {28799#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {28799#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} is VALID [2022-04-28 09:17:38,356 INFO L290 TraceCheckUtils]: 81: Hoare triple {28799#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28806#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:38,357 INFO L290 TraceCheckUtils]: 82: Hoare triple {28806#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {28806#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:38,357 INFO L272 TraceCheckUtils]: 83: Hoare triple {28806#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {28813#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:38,357 INFO L290 TraceCheckUtils]: 84: Hoare triple {28813#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28817#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:38,358 INFO L290 TraceCheckUtils]: 85: Hoare triple {28817#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28508#false} is VALID [2022-04-28 09:17:38,358 INFO L290 TraceCheckUtils]: 86: Hoare triple {28508#false} assume !false; {28508#false} is VALID [2022-04-28 09:17:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:38,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:38,717 INFO L290 TraceCheckUtils]: 86: Hoare triple {28508#false} assume !false; {28508#false} is VALID [2022-04-28 09:17:38,718 INFO L290 TraceCheckUtils]: 85: Hoare triple {28817#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28508#false} is VALID [2022-04-28 09:17:38,718 INFO L290 TraceCheckUtils]: 84: Hoare triple {28813#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28817#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:17:38,718 INFO L272 TraceCheckUtils]: 83: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {28813#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:38,718 INFO L290 TraceCheckUtils]: 82: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,719 INFO L290 TraceCheckUtils]: 81: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,719 INFO L290 TraceCheckUtils]: 80: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,719 INFO L290 TraceCheckUtils]: 79: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,720 INFO L290 TraceCheckUtils]: 78: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,720 INFO L290 TraceCheckUtils]: 77: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,720 INFO L290 TraceCheckUtils]: 76: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,721 INFO L290 TraceCheckUtils]: 75: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,721 INFO L290 TraceCheckUtils]: 74: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,721 INFO L290 TraceCheckUtils]: 73: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,721 INFO L290 TraceCheckUtils]: 72: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,722 INFO L290 TraceCheckUtils]: 71: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,722 INFO L290 TraceCheckUtils]: 70: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,722 INFO L290 TraceCheckUtils]: 69: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,722 INFO L290 TraceCheckUtils]: 68: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,723 INFO L290 TraceCheckUtils]: 67: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,723 INFO L290 TraceCheckUtils]: 66: Hoare triple {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28833#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:38,724 INFO L290 TraceCheckUtils]: 64: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,724 INFO L290 TraceCheckUtils]: 63: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,724 INFO L290 TraceCheckUtils]: 62: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,726 INFO L290 TraceCheckUtils]: 55: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,727 INFO L290 TraceCheckUtils]: 53: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,727 INFO L290 TraceCheckUtils]: 52: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,727 INFO L290 TraceCheckUtils]: 51: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,728 INFO L290 TraceCheckUtils]: 47: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,731 INFO L290 TraceCheckUtils]: 37: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {28888#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {28507#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {28888#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:17:38,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {28507#true} call #t~ret6 := main(); {28507#true} is VALID [2022-04-28 09:17:38,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28507#true} {28507#true} #42#return; {28507#true} is VALID [2022-04-28 09:17:38,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {28507#true} assume true; {28507#true} is VALID [2022-04-28 09:17:38,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {28507#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(14, 2);call #Ultimate.allocInit(12, 3); {28507#true} is VALID [2022-04-28 09:17:38,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {28507#true} call ULTIMATE.init(); {28507#true} is VALID [2022-04-28 09:17:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2022-04-28 09:17:38,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541662931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:38,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:38,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 43, 6] total 55 [2022-04-28 09:17:38,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:38,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1030986134] [2022-04-28 09:17:38,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1030986134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:38,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:38,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 09:17:38,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163222020] [2022-04-28 09:17:38,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:38,741 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 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 87 [2022-04-28 09:17:38,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:38,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:38,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:38,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 09:17:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:38,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 09:17:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2752, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 09:17:38,779 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:42,307 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-04-28 09:17:42,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 09:17:42,307 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 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 87 [2022-04-28 09:17:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:17:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 96 transitions. [2022-04-28 09:17:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 96 transitions. [2022-04-28 09:17:42,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 96 transitions. [2022-04-28 09:17:42,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:42,359 INFO L225 Difference]: With dead ends: 96 [2022-04-28 09:17:42,360 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 09:17:42,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=488, Invalid=8254, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 09:17:42,363 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 3089 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 3168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:17:42,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 173 Invalid, 3168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3089 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 09:17:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 09:17:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-04-28 09:17:42,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:17:42,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 90 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:42,610 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 90 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:42,610 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 90 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:42,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:42,610 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2022-04-28 09:17:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-04-28 09:17:42,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:42,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:42,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 3 states have call successors, (3), 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 91 states. [2022-04-28 09:17:42,611 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 3 states have call successors, (3), 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 91 states. [2022-04-28 09:17:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:17:42,625 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2022-04-28 09:17:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-04-28 09:17:42,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:17:42,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:17:42,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:17:42,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:17:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2022-04-28 09:17:42,627 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2022-04-28 09:17:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:17:42,627 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2022-04-28 09:17:42,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:42,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 90 transitions. [2022-04-28 09:17:42,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2022-04-28 09:17:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 09:17:42,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:17:42,743 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:17:42,759 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 09:17:42,959 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,SelfDestructingSolverStorable47 [2022-04-28 09:17:42,959 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:17:42,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:17:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1642680909, now seen corresponding path program 77 times [2022-04-28 09:17:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:42,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [296788482] [2022-04-28 09:17:42,963 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:17:42,963 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:17:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1642680909, now seen corresponding path program 78 times [2022-04-28 09:17:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:17:42,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822437143] [2022-04-28 09:17:42,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:17:42,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:17:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:43,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:17:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:43,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {29763#(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(14, 2);call #Ultimate.allocInit(12, 3); {29718#true} is VALID [2022-04-28 09:17:43,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {29718#true} assume true; {29718#true} is VALID [2022-04-28 09:17:43,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29718#true} {29718#true} #42#return; {29718#true} is VALID [2022-04-28 09:17:43,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {29718#true} call ULTIMATE.init(); {29763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:17:43,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {29763#(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(14, 2);call #Ultimate.allocInit(12, 3); {29718#true} is VALID [2022-04-28 09:17:43,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {29718#true} assume true; {29718#true} is VALID [2022-04-28 09:17:43,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29718#true} {29718#true} #42#return; {29718#true} is VALID [2022-04-28 09:17:43,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {29718#true} call #t~ret6 := main(); {29718#true} is VALID [2022-04-28 09:17:43,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {29718#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {29723#(= main_~x~0 0)} is VALID [2022-04-28 09:17:43,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {29723#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {29723#(= main_~x~0 0)} is VALID [2022-04-28 09:17:43,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {29723#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:43,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {29724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {29724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:43,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {29724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29725#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:43,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {29725#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29725#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:43,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {29725#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29726#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:43,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {29726#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {29726#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:43,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {29726#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29727#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:43,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {29727#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29727#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:43,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {29727#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:43,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {29728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:43,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {29728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29729#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:43,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {29729#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29729#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:43,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {29729#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29730#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:43,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {29730#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {29730#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:43,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {29730#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29731#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:43,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {29731#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29731#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:43,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {29731#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29732#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:43,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {29732#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29732#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:43,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {29732#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29733#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:43,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {29733#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29733#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:43,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {29733#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29734#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:43,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {29734#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {29734#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:43,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {29734#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29735#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:43,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {29735#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29735#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:43,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {29735#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29736#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:43,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {29736#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29736#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:43,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {29736#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29737#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:43,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {29737#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {29737#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:43,863 INFO L290 TraceCheckUtils]: 35: Hoare triple {29737#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29738#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:43,863 INFO L290 TraceCheckUtils]: 36: Hoare triple {29738#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {29738#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:43,863 INFO L290 TraceCheckUtils]: 37: Hoare triple {29738#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29739#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:43,863 INFO L290 TraceCheckUtils]: 38: Hoare triple {29739#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29739#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:43,864 INFO L290 TraceCheckUtils]: 39: Hoare triple {29739#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29740#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:43,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {29740#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29740#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:43,864 INFO L290 TraceCheckUtils]: 41: Hoare triple {29740#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29741#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:43,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {29741#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29741#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:43,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {29741#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29742#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:43,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {29742#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29742#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:43,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {29742#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29743#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:43,866 INFO L290 TraceCheckUtils]: 46: Hoare triple {29743#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29743#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:43,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {29743#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29744#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:43,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {29744#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29744#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:17:43,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {29744#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29745#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:43,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {29745#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {29745#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:43,867 INFO L290 TraceCheckUtils]: 51: Hoare triple {29745#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29746#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:43,868 INFO L290 TraceCheckUtils]: 52: Hoare triple {29746#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {29746#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:43,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {29746#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29747#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:43,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {29747#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29747#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:43,868 INFO L290 TraceCheckUtils]: 55: Hoare triple {29747#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29748#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:43,869 INFO L290 TraceCheckUtils]: 56: Hoare triple {29748#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29748#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:17:43,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {29748#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29749#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:43,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {29749#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29749#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:17:43,870 INFO L290 TraceCheckUtils]: 59: Hoare triple {29749#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29750#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:43,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {29750#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29750#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:43,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {29750#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29751#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:43,870 INFO L290 TraceCheckUtils]: 62: Hoare triple {29751#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29751#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:43,871 INFO L290 TraceCheckUtils]: 63: Hoare triple {29751#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29752#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:43,871 INFO L290 TraceCheckUtils]: 64: Hoare triple {29752#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {29752#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:43,871 INFO L290 TraceCheckUtils]: 65: Hoare triple {29752#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29753#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:43,872 INFO L290 TraceCheckUtils]: 66: Hoare triple {29753#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29753#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:17:43,872 INFO L290 TraceCheckUtils]: 67: Hoare triple {29753#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29754#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:43,872 INFO L290 TraceCheckUtils]: 68: Hoare triple {29754#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {29754#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:43,872 INFO L290 TraceCheckUtils]: 69: Hoare triple {29754#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29755#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:43,873 INFO L290 TraceCheckUtils]: 70: Hoare triple {29755#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29755#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:17:43,873 INFO L290 TraceCheckUtils]: 71: Hoare triple {29755#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29756#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:43,873 INFO L290 TraceCheckUtils]: 72: Hoare triple {29756#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {29756#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:43,874 INFO L290 TraceCheckUtils]: 73: Hoare triple {29756#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29757#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:17:43,874 INFO L290 TraceCheckUtils]: 74: Hoare triple {29757#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29757#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:17:43,874 INFO L290 TraceCheckUtils]: 75: Hoare triple {29757#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29758#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:43,874 INFO L290 TraceCheckUtils]: 76: Hoare triple {29758#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29758#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:43,875 INFO L290 TraceCheckUtils]: 77: Hoare triple {29758#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29759#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:43,875 INFO L290 TraceCheckUtils]: 78: Hoare triple {29759#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {29759#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:43,875 INFO L290 TraceCheckUtils]: 79: Hoare triple {29759#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29760#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:17:43,876 INFO L290 TraceCheckUtils]: 80: Hoare triple {29760#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {29760#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:17:43,876 INFO L290 TraceCheckUtils]: 81: Hoare triple {29760#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29761#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:17:43,876 INFO L290 TraceCheckUtils]: 82: Hoare triple {29761#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {29761#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:17:43,876 INFO L290 TraceCheckUtils]: 83: Hoare triple {29761#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29762#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 78))} is VALID [2022-04-28 09:17:43,877 INFO L290 TraceCheckUtils]: 84: Hoare triple {29762#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 78))} assume !(~x~0 % 4294967296 < 99); {29719#false} is VALID [2022-04-28 09:17:43,877 INFO L272 TraceCheckUtils]: 85: Hoare triple {29719#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {29719#false} is VALID [2022-04-28 09:17:43,877 INFO L290 TraceCheckUtils]: 86: Hoare triple {29719#false} ~cond := #in~cond; {29719#false} is VALID [2022-04-28 09:17:43,877 INFO L290 TraceCheckUtils]: 87: Hoare triple {29719#false} assume 0 == ~cond; {29719#false} is VALID [2022-04-28 09:17:43,877 INFO L290 TraceCheckUtils]: 88: Hoare triple {29719#false} assume !false; {29719#false} is VALID [2022-04-28 09:17:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:43,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:17:43,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822437143] [2022-04-28 09:17:43,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822437143] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:17:43,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335693322] [2022-04-28 09:17:43,895 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:17:43,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:17:43,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:17:43,909 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 09:17:43,910 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 09:17:46,269 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2022-04-28 09:17:46,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:17:46,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 86 conjunts are in the unsatisfiable core [2022-04-28 09:17:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:17:46,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:17:47,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {29718#true} call ULTIMATE.init(); {29718#true} is VALID [2022-04-28 09:17:47,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {29718#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(14, 2);call #Ultimate.allocInit(12, 3); {29718#true} is VALID [2022-04-28 09:17:47,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {29718#true} assume true; {29718#true} is VALID [2022-04-28 09:17:47,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29718#true} {29718#true} #42#return; {29718#true} is VALID [2022-04-28 09:17:47,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {29718#true} call #t~ret6 := main(); {29718#true} is VALID [2022-04-28 09:17:47,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {29718#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {29723#(= main_~x~0 0)} is VALID [2022-04-28 09:17:47,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {29723#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {29723#(= main_~x~0 0)} is VALID [2022-04-28 09:17:47,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {29723#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:47,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {29724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {29724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:17:47,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {29724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29725#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:47,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {29725#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29725#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:17:47,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {29725#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29726#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:47,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {29726#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {29726#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:17:47,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {29726#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29727#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:47,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {29727#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29727#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:17:47,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {29727#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:47,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {29728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:17:47,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {29728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29729#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:47,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {29729#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29729#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:17:47,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {29729#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29730#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:47,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {29730#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {29730#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:17:47,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {29730#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29731#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:47,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {29731#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29731#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:17:47,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {29731#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29732#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:47,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {29732#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29732#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:17:47,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {29732#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29733#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:47,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {29733#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29733#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:17:47,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {29733#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29734#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:47,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {29734#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {29734#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:17:47,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {29734#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29735#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:47,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {29735#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29735#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:17:47,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {29735#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29736#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:47,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {29736#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29736#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:17:47,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {29736#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29737#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:47,280 INFO L290 TraceCheckUtils]: 34: Hoare triple {29737#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {29737#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:17:47,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {29737#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29738#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:47,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {29738#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {29738#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:17:47,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {29738#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29739#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:47,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {29739#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29739#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:17:47,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {29739#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29740#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:47,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {29740#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29740#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:17:47,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {29740#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29741#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:47,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {29741#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29741#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:17:47,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {29741#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29742#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:47,284 INFO L290 TraceCheckUtils]: 44: Hoare triple {29742#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29742#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:17:47,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {29742#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29902#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:47,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {29902#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29902#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} is VALID [2022-04-28 09:17:47,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {29902#(and (<= main_~x~0 40) (<= (mod main_~y~0 2) 0) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29909#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,285 INFO L290 TraceCheckUtils]: 48: Hoare triple {29909#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {29909#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {29909#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29916#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:47,286 INFO L290 TraceCheckUtils]: 50: Hoare triple {29916#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {29916#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:17:47,286 INFO L290 TraceCheckUtils]: 51: Hoare triple {29916#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29923#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:47,286 INFO L290 TraceCheckUtils]: 52: Hoare triple {29923#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {29923#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:17:47,287 INFO L290 TraceCheckUtils]: 53: Hoare triple {29923#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29930#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:47,287 INFO L290 TraceCheckUtils]: 54: Hoare triple {29930#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29930#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:17:47,288 INFO L290 TraceCheckUtils]: 55: Hoare triple {29930#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29937#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,288 INFO L290 TraceCheckUtils]: 56: Hoare triple {29937#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {29937#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,288 INFO L290 TraceCheckUtils]: 57: Hoare triple {29937#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29944#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,289 INFO L290 TraceCheckUtils]: 58: Hoare triple {29944#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {29944#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,289 INFO L290 TraceCheckUtils]: 59: Hoare triple {29944#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29951#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:47,289 INFO L290 TraceCheckUtils]: 60: Hoare triple {29951#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29951#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:17:47,290 INFO L290 TraceCheckUtils]: 61: Hoare triple {29951#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29958#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:47,290 INFO L290 TraceCheckUtils]: 62: Hoare triple {29958#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {29958#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:17:47,290 INFO L290 TraceCheckUtils]: 63: Hoare triple {29958#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29965#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:47,291 INFO L290 TraceCheckUtils]: 64: Hoare triple {29965#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {29965#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:17:47,291 INFO L290 TraceCheckUtils]: 65: Hoare triple {29965#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29972#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,291 INFO L290 TraceCheckUtils]: 66: Hoare triple {29972#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {29972#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,292 INFO L290 TraceCheckUtils]: 67: Hoare triple {29972#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29979#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:47,292 INFO L290 TraceCheckUtils]: 68: Hoare triple {29979#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {29979#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:17:47,293 INFO L290 TraceCheckUtils]: 69: Hoare triple {29979#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29986#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,293 INFO L290 TraceCheckUtils]: 70: Hoare triple {29986#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {29986#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,293 INFO L290 TraceCheckUtils]: 71: Hoare triple {29986#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {29993#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:47,294 INFO L290 TraceCheckUtils]: 72: Hoare triple {29993#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {29993#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:17:47,294 INFO L290 TraceCheckUtils]: 73: Hoare triple {29993#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30000#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,294 INFO L290 TraceCheckUtils]: 74: Hoare triple {30000#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {30000#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,295 INFO L290 TraceCheckUtils]: 75: Hoare triple {30000#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30007#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:47,295 INFO L290 TraceCheckUtils]: 76: Hoare triple {30007#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {30007#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:17:47,295 INFO L290 TraceCheckUtils]: 77: Hoare triple {30007#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30014#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:47,296 INFO L290 TraceCheckUtils]: 78: Hoare triple {30014#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {30014#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} is VALID [2022-04-28 09:17:47,296 INFO L290 TraceCheckUtils]: 79: Hoare triple {30014#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30021#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} is VALID [2022-04-28 09:17:47,296 INFO L290 TraceCheckUtils]: 80: Hoare triple {30021#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {30021#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} is VALID [2022-04-28 09:17:47,297 INFO L290 TraceCheckUtils]: 81: Hoare triple {30021#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30028#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,297 INFO L290 TraceCheckUtils]: 82: Hoare triple {30028#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {30028#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:17:47,297 INFO L290 TraceCheckUtils]: 83: Hoare triple {30028#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30035#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} is VALID [2022-04-28 09:17:47,298 INFO L290 TraceCheckUtils]: 84: Hoare triple {30035#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} assume !(~x~0 % 4294967296 < 99); {29719#false} is VALID [2022-04-28 09:17:47,298 INFO L272 TraceCheckUtils]: 85: Hoare triple {29719#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {29719#false} is VALID [2022-04-28 09:17:47,298 INFO L290 TraceCheckUtils]: 86: Hoare triple {29719#false} ~cond := #in~cond; {29719#false} is VALID [2022-04-28 09:17:47,298 INFO L290 TraceCheckUtils]: 87: Hoare triple {29719#false} assume 0 == ~cond; {29719#false} is VALID [2022-04-28 09:17:47,298 INFO L290 TraceCheckUtils]: 88: Hoare triple {29719#false} assume !false; {29719#false} is VALID [2022-04-28 09:17:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:47,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:17:56,135 INFO L290 TraceCheckUtils]: 88: Hoare triple {29719#false} assume !false; {29719#false} is VALID [2022-04-28 09:17:56,135 INFO L290 TraceCheckUtils]: 87: Hoare triple {30054#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29719#false} is VALID [2022-04-28 09:17:56,136 INFO L290 TraceCheckUtils]: 86: Hoare triple {30058#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30054#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:17:56,136 INFO L272 TraceCheckUtils]: 85: Hoare triple {30062#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {30058#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:17:56,137 INFO L290 TraceCheckUtils]: 84: Hoare triple {30066#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !(~x~0 % 4294967296 < 99); {30062#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:17:56,138 INFO L290 TraceCheckUtils]: 83: Hoare triple {30070#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30066#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,138 INFO L290 TraceCheckUtils]: 82: Hoare triple {30074#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99) (not (< (mod main_~x~0 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30070#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-28 09:17:56,139 INFO L290 TraceCheckUtils]: 81: Hoare triple {30078#(or (not (< (mod (+ main_~x~0 2) 4294967296) 99)) (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30074#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-28 09:17:56,139 INFO L290 TraceCheckUtils]: 80: Hoare triple {30078#(or (not (< (mod (+ main_~x~0 2) 4294967296) 99)) (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {30078#(or (not (< (mod (+ main_~x~0 2) 4294967296) 99)) (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,140 INFO L290 TraceCheckUtils]: 79: Hoare triple {30085#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 4) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30078#(or (not (< (mod (+ main_~x~0 2) 4294967296) 99)) (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,141 INFO L290 TraceCheckUtils]: 78: Hoare triple {30085#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 4) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30085#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 4) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,142 INFO L290 TraceCheckUtils]: 77: Hoare triple {30092#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 6) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30085#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 4) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,142 INFO L290 TraceCheckUtils]: 76: Hoare triple {30092#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 6) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30092#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 6) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {30099#(or (not (< (mod (+ main_~x~0 8) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30092#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 6) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {30099#(or (not (< (mod (+ main_~x~0 8) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {30099#(or (not (< (mod (+ main_~x~0 8) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-28 09:17:56,144 INFO L290 TraceCheckUtils]: 73: Hoare triple {30106#(or (not (< (mod (+ main_~x~0 10) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30099#(or (not (< (mod (+ main_~x~0 8) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-28 09:17:56,145 INFO L290 TraceCheckUtils]: 72: Hoare triple {30106#(or (not (< (mod (+ main_~x~0 10) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {30106#(or (not (< (mod (+ main_~x~0 10) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-28 09:17:56,145 INFO L290 TraceCheckUtils]: 71: Hoare triple {30113#(or (not (< (mod (+ main_~x~0 12) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30106#(or (not (< (mod (+ main_~x~0 10) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-28 09:17:56,146 INFO L290 TraceCheckUtils]: 70: Hoare triple {30113#(or (not (< (mod (+ main_~x~0 12) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {30113#(or (not (< (mod (+ main_~x~0 12) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-28 09:17:56,147 INFO L290 TraceCheckUtils]: 69: Hoare triple {30120#(or (not (< (mod (+ main_~x~0 14) 4294967296) 99)) (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30113#(or (not (< (mod (+ main_~x~0 12) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-28 09:17:56,147 INFO L290 TraceCheckUtils]: 68: Hoare triple {30120#(or (not (< (mod (+ main_~x~0 14) 4294967296) 99)) (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {30120#(or (not (< (mod (+ main_~x~0 14) 4294967296) 99)) (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,148 INFO L290 TraceCheckUtils]: 67: Hoare triple {30127#(or (not (< (mod (+ main_~x~0 16) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30120#(or (not (< (mod (+ main_~x~0 14) 4294967296) 99)) (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,149 INFO L290 TraceCheckUtils]: 66: Hoare triple {30127#(or (not (< (mod (+ main_~x~0 16) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {30127#(or (not (< (mod (+ main_~x~0 16) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-28 09:17:56,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {30134#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (not (< (mod (+ main_~x~0 18) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30127#(or (not (< (mod (+ main_~x~0 16) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-28 09:17:56,150 INFO L290 TraceCheckUtils]: 64: Hoare triple {30134#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (not (< (mod (+ main_~x~0 18) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {30134#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (not (< (mod (+ main_~x~0 18) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {30141#(or (not (< (mod (+ main_~x~0 20) 4294967296) 99)) (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30134#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (not (< (mod (+ main_~x~0 18) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {30141#(or (not (< (mod (+ main_~x~0 20) 4294967296) 99)) (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {30141#(or (not (< (mod (+ main_~x~0 20) 4294967296) 99)) (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,154 INFO L290 TraceCheckUtils]: 61: Hoare triple {30148#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (not (< (mod (+ main_~x~0 22) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30141#(or (not (< (mod (+ main_~x~0 20) 4294967296) 99)) (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,154 INFO L290 TraceCheckUtils]: 60: Hoare triple {30148#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (not (< (mod (+ main_~x~0 22) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {30148#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (not (< (mod (+ main_~x~0 22) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,155 INFO L290 TraceCheckUtils]: 59: Hoare triple {30155#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 24) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30148#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (not (< (mod (+ main_~x~0 22) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,155 INFO L290 TraceCheckUtils]: 58: Hoare triple {30155#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 24) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30155#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 24) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {30162#(or (not (< (mod (+ main_~x~0 26) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30155#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 24) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {30162#(or (not (< (mod (+ main_~x~0 26) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {30162#(or (not (< (mod (+ main_~x~0 26) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-28 09:17:56,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {30169#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 28) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30162#(or (not (< (mod (+ main_~x~0 26) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-28 09:17:56,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {30169#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 28) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30169#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 28) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {30176#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 99)) (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30169#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 28) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,159 INFO L290 TraceCheckUtils]: 52: Hoare triple {30176#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 99)) (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {30176#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 99)) (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,160 INFO L290 TraceCheckUtils]: 51: Hoare triple {30183#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (not (< (mod (+ 32 main_~x~0) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30176#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 99)) (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {30183#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (not (< (mod (+ 32 main_~x~0) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {30183#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (not (< (mod (+ 32 main_~x~0) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {30190#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 34) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30183#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (not (< (mod (+ 32 main_~x~0) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {30190#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 34) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30190#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 34) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,167 INFO L290 TraceCheckUtils]: 47: Hoare triple {30197#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (not (< (mod (+ main_~x~0 36) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30190#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 34) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,167 INFO L290 TraceCheckUtils]: 46: Hoare triple {30197#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (not (< (mod (+ main_~x~0 36) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {30197#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (not (< (mod (+ main_~x~0 36) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {30204#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 38) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30197#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (not (< (mod (+ main_~x~0 36) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:17:56,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {30204#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 38) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {30204#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 38) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:56,187 INFO L290 TraceCheckUtils]: 43: Hoare triple {30211#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ 40 main_~x~0) 4294967296) 99)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30204#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 38) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:56,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {30211#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ 40 main_~x~0) 4294967296) 99)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {30211#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ 40 main_~x~0) 4294967296) 99)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:17:56,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {30218#(or (not (< (mod (+ 42 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 44 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30211#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ 40 main_~x~0) 4294967296) 99)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:17:56,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {30218#(or (not (< (mod (+ 42 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 44 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {30218#(or (not (< (mod (+ 42 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 44 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:17:56,192 INFO L290 TraceCheckUtils]: 39: Hoare triple {30225#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30218#(or (not (< (mod (+ 42 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 44 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:17:56,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {30225#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {30225#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:56,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {30232#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (not (< (mod (+ main_~x~0 46) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30225#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:56,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {30232#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (not (< (mod (+ main_~x~0 46) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {30232#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (not (< (mod (+ main_~x~0 46) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:56,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {30239#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99) (not (< (mod (+ main_~x~0 48) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30232#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (not (< (mod (+ main_~x~0 46) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:56,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {30239#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99) (not (< (mod (+ main_~x~0 48) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30239#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99) (not (< (mod (+ main_~x~0 48) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {30246#(or (not (< (mod (+ main_~x~0 50) 4294967296) 99)) (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30239#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99) (not (< (mod (+ main_~x~0 48) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {30246#(or (not (< (mod (+ main_~x~0 50) 4294967296) 99)) (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {30246#(or (not (< (mod (+ main_~x~0 50) 4294967296) 99)) (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:56,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {30253#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 52) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30246#(or (not (< (mod (+ main_~x~0 50) 4294967296) 99)) (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:56,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {30253#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 52) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30253#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 52) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {30260#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 54) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30253#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 52) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {30260#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 54) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30260#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 54) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {30267#(or (not (< (mod (+ 56 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30260#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 54) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {30267#(or (not (< (mod (+ 56 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {30267#(or (not (< (mod (+ 56 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:56,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {30274#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 58) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30267#(or (not (< (mod (+ 56 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:56,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {30274#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 58) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30274#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 58) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {30281#(or (not (< (mod (+ main_~x~0 60) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30274#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 58) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {30281#(or (not (< (mod (+ main_~x~0 60) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {30281#(or (not (< (mod (+ main_~x~0 60) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} is VALID [2022-04-28 09:17:56,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {30288#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 62) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30281#(or (not (< (mod (+ main_~x~0 60) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} is VALID [2022-04-28 09:17:56,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {30288#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 62) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30288#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 62) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {30295#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 66 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30288#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 62) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {30295#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 66 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {30295#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 66 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:17:56,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {30302#(or (not (< (mod (+ 66 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30295#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 66 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:17:56,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {30302#(or (not (< (mod (+ 66 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {30302#(or (not (< (mod (+ 66 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:17:56,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {30309#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 70) 4294967296) 99) (not (< (mod (+ 68 main_~x~0) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30302#(or (not (< (mod (+ 66 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:17:56,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {30309#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 70) 4294967296) 99) (not (< (mod (+ 68 main_~x~0) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30309#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 70) 4294967296) 99) (not (< (mod (+ 68 main_~x~0) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {30316#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 70) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30309#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 70) 4294967296) 99) (not (< (mod (+ 68 main_~x~0) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {30316#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 70) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {30316#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 70) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {30323#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 74) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30316#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 70) 4294967296) 99)))} is VALID [2022-04-28 09:17:56,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {30323#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 74) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {30323#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 74) 4294967296) 99))} is VALID [2022-04-28 09:17:56,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {30330#(or (not (< (mod (+ main_~x~0 74) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30323#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 74) 4294967296) 99))} is VALID [2022-04-28 09:17:56,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {30330#(or (not (< (mod (+ main_~x~0 74) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {30330#(or (not (< (mod (+ main_~x~0 74) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:17:56,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {30337#(or (< (mod (+ main_~x~0 78) 4294967296) 99) (not (< (mod (+ 76 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {30330#(or (not (< (mod (+ main_~x~0 74) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:17:56,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {30337#(or (< (mod (+ main_~x~0 78) 4294967296) 99) (not (< (mod (+ 76 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {30337#(or (< (mod (+ main_~x~0 78) 4294967296) 99) (not (< (mod (+ 76 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:56,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {29718#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {30337#(or (< (mod (+ main_~x~0 78) 4294967296) 99) (not (< (mod (+ 76 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:17:56,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {29718#true} call #t~ret6 := main(); {29718#true} is VALID [2022-04-28 09:17:56,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29718#true} {29718#true} #42#return; {29718#true} is VALID [2022-04-28 09:17:56,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {29718#true} assume true; {29718#true} is VALID [2022-04-28 09:17:56,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {29718#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(14, 2);call #Ultimate.allocInit(12, 3); {29718#true} is VALID [2022-04-28 09:17:56,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {29718#true} call ULTIMATE.init(); {29718#true} is VALID [2022-04-28 09:17:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:17:56,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335693322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:17:56,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:17:56,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 46] total 107 [2022-04-28 09:17:56,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:17:56,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [296788482] [2022-04-28 09:17:56,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [296788482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:17:56,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:17:56,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 09:17:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842206600] [2022-04-28 09:17:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:17:56,250 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 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 89 [2022-04-28 09:17:56,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:17:56,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:17:56,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:17:56,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 09:17:56,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:17:56,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 09:17:56,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2754, Invalid=8588, Unknown=0, NotChecked=0, Total=11342 [2022-04-28 09:17:56,314 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:00,866 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2022-04-28 09:18:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 09:18:00,866 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 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 89 [2022-04-28 09:18:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:18:00,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 98 transitions. [2022-04-28 09:18:00,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 98 transitions. [2022-04-28 09:18:00,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 98 transitions. [2022-04-28 09:18:00,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:00,938 INFO L225 Difference]: With dead ends: 98 [2022-04-28 09:18:00,938 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 09:18:00,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4000 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=4595, Invalid=16867, Unknown=0, NotChecked=0, Total=21462 [2022-04-28 09:18:00,940 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 87 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3179 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 3260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 09:18:00,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 108 Invalid, 3260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3179 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 09:18:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 09:18:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-04-28 09:18:01,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:18:01,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 92 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:01,202 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 92 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:01,202 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 92 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:01,203 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2022-04-28 09:18:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2022-04-28 09:18:01,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:18:01,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:18:01,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 3 states have call successors, (3), 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 93 states. [2022-04-28 09:18:01,204 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 3 states have call successors, (3), 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 93 states. [2022-04-28 09:18:01,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:01,204 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2022-04-28 09:18:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2022-04-28 09:18:01,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:18:01,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:18:01,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:18:01,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:18:01,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2022-04-28 09:18:01,206 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2022-04-28 09:18:01,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:18:01,206 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2022-04-28 09:18:01,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:01,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 92 transitions. [2022-04-28 09:18:01,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2022-04-28 09:18:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 09:18:01,385 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:18:01,385 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:18:01,392 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 09:18:01,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 09:18:01,586 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:18:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:18:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1321389712, now seen corresponding path program 79 times [2022-04-28 09:18:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:18:01,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1809705625] [2022-04-28 09:18:01,591 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:18:01,591 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:18:01,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1321389712, now seen corresponding path program 80 times [2022-04-28 09:18:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:18:01,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704638854] [2022-04-28 09:18:01,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:18:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:18:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:02,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:18:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:02,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {31053#(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(14, 2);call #Ultimate.allocInit(12, 3); {31007#true} is VALID [2022-04-28 09:18:02,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {31007#true} assume true; {31007#true} is VALID [2022-04-28 09:18:02,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31007#true} {31007#true} #42#return; {31007#true} is VALID [2022-04-28 09:18:02,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {31007#true} call ULTIMATE.init(); {31053#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:18:02,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {31053#(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(14, 2);call #Ultimate.allocInit(12, 3); {31007#true} is VALID [2022-04-28 09:18:02,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {31007#true} assume true; {31007#true} is VALID [2022-04-28 09:18:02,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31007#true} {31007#true} #42#return; {31007#true} is VALID [2022-04-28 09:18:02,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {31007#true} call #t~ret6 := main(); {31007#true} is VALID [2022-04-28 09:18:02,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {31007#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {31012#(= main_~x~0 0)} is VALID [2022-04-28 09:18:02,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {31012#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {31012#(= main_~x~0 0)} is VALID [2022-04-28 09:18:02,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {31012#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31013#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:02,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {31013#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {31013#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:02,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {31013#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:02,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {31014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:02,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {31014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31015#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:02,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {31015#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {31015#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:02,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {31015#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31016#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:02,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {31016#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31016#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:02,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {31016#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31017#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:02,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {31017#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31017#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:02,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {31017#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31018#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:02,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {31018#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31018#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:02,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {31018#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31019#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:02,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {31019#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {31019#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:02,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {31019#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31020#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:02,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {31020#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31020#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:02,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {31020#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31021#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:02,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {31021#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31021#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:02,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {31021#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31022#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:02,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {31022#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31022#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:02,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {31022#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31023#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:02,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {31023#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {31023#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:02,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {31023#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31024#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:02,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {31024#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31024#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:02,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {31024#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31025#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:02,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {31025#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31025#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:02,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {31025#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31026#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:02,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {31026#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {31026#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:02,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {31026#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31027#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:02,502 INFO L290 TraceCheckUtils]: 36: Hoare triple {31027#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {31027#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:02,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {31027#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31028#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:02,503 INFO L290 TraceCheckUtils]: 38: Hoare triple {31028#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31028#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:02,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {31028#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31029#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:02,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {31029#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31029#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:02,504 INFO L290 TraceCheckUtils]: 41: Hoare triple {31029#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31030#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:02,504 INFO L290 TraceCheckUtils]: 42: Hoare triple {31030#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31030#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:02,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {31030#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31031#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:02,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {31031#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31031#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:02,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {31031#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31032#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:02,506 INFO L290 TraceCheckUtils]: 46: Hoare triple {31032#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31032#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:02,506 INFO L290 TraceCheckUtils]: 47: Hoare triple {31032#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31033#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:02,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {31033#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31033#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:02,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {31033#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31034#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:02,507 INFO L290 TraceCheckUtils]: 50: Hoare triple {31034#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {31034#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:02,508 INFO L290 TraceCheckUtils]: 51: Hoare triple {31034#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31035#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:02,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {31035#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {31035#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:02,509 INFO L290 TraceCheckUtils]: 53: Hoare triple {31035#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31036#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:02,509 INFO L290 TraceCheckUtils]: 54: Hoare triple {31036#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31036#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:02,509 INFO L290 TraceCheckUtils]: 55: Hoare triple {31036#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31037#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:02,510 INFO L290 TraceCheckUtils]: 56: Hoare triple {31037#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31037#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:02,510 INFO L290 TraceCheckUtils]: 57: Hoare triple {31037#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31038#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:02,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {31038#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31038#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:02,511 INFO L290 TraceCheckUtils]: 59: Hoare triple {31038#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31039#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:02,511 INFO L290 TraceCheckUtils]: 60: Hoare triple {31039#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31039#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:02,512 INFO L290 TraceCheckUtils]: 61: Hoare triple {31039#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31040#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:02,512 INFO L290 TraceCheckUtils]: 62: Hoare triple {31040#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31040#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:02,512 INFO L290 TraceCheckUtils]: 63: Hoare triple {31040#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31041#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:02,513 INFO L290 TraceCheckUtils]: 64: Hoare triple {31041#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {31041#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:02,513 INFO L290 TraceCheckUtils]: 65: Hoare triple {31041#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31042#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:02,514 INFO L290 TraceCheckUtils]: 66: Hoare triple {31042#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31042#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:02,514 INFO L290 TraceCheckUtils]: 67: Hoare triple {31042#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31043#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:02,514 INFO L290 TraceCheckUtils]: 68: Hoare triple {31043#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {31043#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:02,515 INFO L290 TraceCheckUtils]: 69: Hoare triple {31043#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31044#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:02,515 INFO L290 TraceCheckUtils]: 70: Hoare triple {31044#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31044#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:02,516 INFO L290 TraceCheckUtils]: 71: Hoare triple {31044#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31045#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:02,516 INFO L290 TraceCheckUtils]: 72: Hoare triple {31045#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {31045#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:02,516 INFO L290 TraceCheckUtils]: 73: Hoare triple {31045#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31046#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:02,517 INFO L290 TraceCheckUtils]: 74: Hoare triple {31046#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31046#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:02,517 INFO L290 TraceCheckUtils]: 75: Hoare triple {31046#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31047#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:02,518 INFO L290 TraceCheckUtils]: 76: Hoare triple {31047#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31047#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:02,518 INFO L290 TraceCheckUtils]: 77: Hoare triple {31047#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31048#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:02,518 INFO L290 TraceCheckUtils]: 78: Hoare triple {31048#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {31048#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:02,519 INFO L290 TraceCheckUtils]: 79: Hoare triple {31048#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31049#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:02,519 INFO L290 TraceCheckUtils]: 80: Hoare triple {31049#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {31049#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:02,520 INFO L290 TraceCheckUtils]: 81: Hoare triple {31049#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31050#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:02,520 INFO L290 TraceCheckUtils]: 82: Hoare triple {31050#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {31050#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:02,520 INFO L290 TraceCheckUtils]: 83: Hoare triple {31050#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31051#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:02,521 INFO L290 TraceCheckUtils]: 84: Hoare triple {31051#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {31051#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:02,521 INFO L290 TraceCheckUtils]: 85: Hoare triple {31051#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31052#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:02,522 INFO L290 TraceCheckUtils]: 86: Hoare triple {31052#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 80))} assume !(~x~0 % 4294967296 < 99); {31008#false} is VALID [2022-04-28 09:18:02,522 INFO L272 TraceCheckUtils]: 87: Hoare triple {31008#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {31008#false} is VALID [2022-04-28 09:18:02,522 INFO L290 TraceCheckUtils]: 88: Hoare triple {31008#false} ~cond := #in~cond; {31008#false} is VALID [2022-04-28 09:18:02,522 INFO L290 TraceCheckUtils]: 89: Hoare triple {31008#false} assume 0 == ~cond; {31008#false} is VALID [2022-04-28 09:18:02,522 INFO L290 TraceCheckUtils]: 90: Hoare triple {31008#false} assume !false; {31008#false} is VALID [2022-04-28 09:18:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:18:02,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:18:02,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704638854] [2022-04-28 09:18:02,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704638854] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:18:02,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113659292] [2022-04-28 09:18:02,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:18:02,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:18:02,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:18:02,524 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 09:18:02,525 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 09:18:02,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:18:02,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:18:02,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-28 09:18:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:02,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:18:03,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {31007#true} call ULTIMATE.init(); {31007#true} is VALID [2022-04-28 09:18:03,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {31007#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(14, 2);call #Ultimate.allocInit(12, 3); {31007#true} is VALID [2022-04-28 09:18:03,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {31007#true} assume true; {31007#true} is VALID [2022-04-28 09:18:03,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31007#true} {31007#true} #42#return; {31007#true} is VALID [2022-04-28 09:18:03,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {31007#true} call #t~ret6 := main(); {31007#true} is VALID [2022-04-28 09:18:03,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {31007#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {31012#(= main_~x~0 0)} is VALID [2022-04-28 09:18:03,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {31012#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {31012#(= main_~x~0 0)} is VALID [2022-04-28 09:18:03,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {31012#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31013#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:03,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {31013#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {31013#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:03,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {31013#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:03,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {31014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:03,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {31014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31015#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:03,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {31015#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {31015#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:03,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {31015#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31016#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:03,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {31016#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31016#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:03,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {31016#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31017#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:03,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {31017#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31017#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:03,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {31017#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31018#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:03,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {31018#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31018#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:03,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {31018#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31019#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:03,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {31019#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {31019#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:03,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {31019#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31020#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:03,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {31020#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31020#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:03,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {31020#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31021#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:03,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {31021#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31021#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:03,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {31021#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31022#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:03,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {31022#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31022#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:03,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {31022#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31023#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:03,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {31023#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {31023#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:03,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {31023#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31024#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:03,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {31024#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31024#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:03,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {31024#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31025#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:03,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {31025#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31025#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:03,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {31025#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31026#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:03,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {31026#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {31026#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:03,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {31026#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31027#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:03,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {31027#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {31027#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:03,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {31027#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31028#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:03,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {31028#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31028#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:03,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {31028#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31029#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:03,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {31029#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31029#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:03,447 INFO L290 TraceCheckUtils]: 41: Hoare triple {31029#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31030#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:03,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {31030#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31030#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:03,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {31030#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31031#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:03,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {31031#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31031#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:03,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {31031#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31032#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:03,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {31032#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31032#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:03,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {31032#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31033#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:03,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {31033#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31033#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:03,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {31033#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31034#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:03,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {31034#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {31034#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:03,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {31034#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31035#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:03,452 INFO L290 TraceCheckUtils]: 52: Hoare triple {31035#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {31035#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:03,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {31035#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31036#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:03,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {31036#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31036#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:03,453 INFO L290 TraceCheckUtils]: 55: Hoare triple {31036#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31037#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:03,453 INFO L290 TraceCheckUtils]: 56: Hoare triple {31037#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31037#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:03,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {31037#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31038#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:03,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {31038#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31038#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:03,454 INFO L290 TraceCheckUtils]: 59: Hoare triple {31038#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31039#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:03,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {31039#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31039#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:03,455 INFO L290 TraceCheckUtils]: 61: Hoare triple {31039#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31040#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:03,455 INFO L290 TraceCheckUtils]: 62: Hoare triple {31040#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31040#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:03,456 INFO L290 TraceCheckUtils]: 63: Hoare triple {31040#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31041#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:03,456 INFO L290 TraceCheckUtils]: 64: Hoare triple {31041#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {31041#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:03,457 INFO L290 TraceCheckUtils]: 65: Hoare triple {31041#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31042#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:03,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {31042#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31042#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:03,457 INFO L290 TraceCheckUtils]: 67: Hoare triple {31042#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31043#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:03,458 INFO L290 TraceCheckUtils]: 68: Hoare triple {31043#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {31043#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:03,458 INFO L290 TraceCheckUtils]: 69: Hoare triple {31043#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31044#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:03,459 INFO L290 TraceCheckUtils]: 70: Hoare triple {31044#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31044#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:03,459 INFO L290 TraceCheckUtils]: 71: Hoare triple {31044#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31045#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:03,459 INFO L290 TraceCheckUtils]: 72: Hoare triple {31045#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {31045#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:03,460 INFO L290 TraceCheckUtils]: 73: Hoare triple {31045#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31046#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:03,460 INFO L290 TraceCheckUtils]: 74: Hoare triple {31046#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31046#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:03,461 INFO L290 TraceCheckUtils]: 75: Hoare triple {31046#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31047#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:03,461 INFO L290 TraceCheckUtils]: 76: Hoare triple {31047#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {31047#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:03,461 INFO L290 TraceCheckUtils]: 77: Hoare triple {31047#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31048#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:03,462 INFO L290 TraceCheckUtils]: 78: Hoare triple {31048#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {31048#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:03,462 INFO L290 TraceCheckUtils]: 79: Hoare triple {31048#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31049#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:03,463 INFO L290 TraceCheckUtils]: 80: Hoare triple {31049#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {31049#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:03,463 INFO L290 TraceCheckUtils]: 81: Hoare triple {31049#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31050#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:03,463 INFO L290 TraceCheckUtils]: 82: Hoare triple {31050#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {31050#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:03,464 INFO L290 TraceCheckUtils]: 83: Hoare triple {31050#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31051#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:03,464 INFO L290 TraceCheckUtils]: 84: Hoare triple {31051#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {31051#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:03,465 INFO L290 TraceCheckUtils]: 85: Hoare triple {31051#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31312#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:03,465 INFO L290 TraceCheckUtils]: 86: Hoare triple {31312#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !(~x~0 % 4294967296 < 99); {31008#false} is VALID [2022-04-28 09:18:03,465 INFO L272 TraceCheckUtils]: 87: Hoare triple {31008#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {31008#false} is VALID [2022-04-28 09:18:03,465 INFO L290 TraceCheckUtils]: 88: Hoare triple {31008#false} ~cond := #in~cond; {31008#false} is VALID [2022-04-28 09:18:03,465 INFO L290 TraceCheckUtils]: 89: Hoare triple {31008#false} assume 0 == ~cond; {31008#false} is VALID [2022-04-28 09:18:03,465 INFO L290 TraceCheckUtils]: 90: Hoare triple {31008#false} assume !false; {31008#false} is VALID [2022-04-28 09:18:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:18:03,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:18:05,686 INFO L290 TraceCheckUtils]: 90: Hoare triple {31008#false} assume !false; {31008#false} is VALID [2022-04-28 09:18:05,686 INFO L290 TraceCheckUtils]: 89: Hoare triple {31008#false} assume 0 == ~cond; {31008#false} is VALID [2022-04-28 09:18:05,686 INFO L290 TraceCheckUtils]: 88: Hoare triple {31008#false} ~cond := #in~cond; {31008#false} is VALID [2022-04-28 09:18:05,686 INFO L272 TraceCheckUtils]: 87: Hoare triple {31008#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {31008#false} is VALID [2022-04-28 09:18:05,686 INFO L290 TraceCheckUtils]: 86: Hoare triple {31340#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {31008#false} is VALID [2022-04-28 09:18:05,687 INFO L290 TraceCheckUtils]: 85: Hoare triple {31344#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31340#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:18:05,687 INFO L290 TraceCheckUtils]: 84: Hoare triple {31344#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31344#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:18:05,688 INFO L290 TraceCheckUtils]: 83: Hoare triple {31351#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31344#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:18:05,688 INFO L290 TraceCheckUtils]: 82: Hoare triple {31351#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31351#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:18:05,689 INFO L290 TraceCheckUtils]: 81: Hoare triple {31358#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31351#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:18:05,689 INFO L290 TraceCheckUtils]: 80: Hoare triple {31358#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31358#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:18:05,690 INFO L290 TraceCheckUtils]: 79: Hoare triple {31365#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31358#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:18:05,690 INFO L290 TraceCheckUtils]: 78: Hoare triple {31365#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31365#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:18:05,691 INFO L290 TraceCheckUtils]: 77: Hoare triple {31372#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31365#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:18:05,691 INFO L290 TraceCheckUtils]: 76: Hoare triple {31372#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31372#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:18:05,691 INFO L290 TraceCheckUtils]: 75: Hoare triple {31379#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31372#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:18:05,692 INFO L290 TraceCheckUtils]: 74: Hoare triple {31379#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31379#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:18:05,692 INFO L290 TraceCheckUtils]: 73: Hoare triple {31386#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31379#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:18:05,693 INFO L290 TraceCheckUtils]: 72: Hoare triple {31386#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31386#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:18:05,693 INFO L290 TraceCheckUtils]: 71: Hoare triple {31393#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31386#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:18:05,693 INFO L290 TraceCheckUtils]: 70: Hoare triple {31393#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31393#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:18:05,694 INFO L290 TraceCheckUtils]: 69: Hoare triple {31400#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31393#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:18:05,694 INFO L290 TraceCheckUtils]: 68: Hoare triple {31400#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31400#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:18:05,695 INFO L290 TraceCheckUtils]: 67: Hoare triple {31407#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31400#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:18:05,695 INFO L290 TraceCheckUtils]: 66: Hoare triple {31407#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31407#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:18:05,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {31414#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31407#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:18:05,696 INFO L290 TraceCheckUtils]: 64: Hoare triple {31414#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31414#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:18:05,697 INFO L290 TraceCheckUtils]: 63: Hoare triple {31421#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31414#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:18:05,697 INFO L290 TraceCheckUtils]: 62: Hoare triple {31421#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31421#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:18:05,697 INFO L290 TraceCheckUtils]: 61: Hoare triple {31428#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31421#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:18:05,698 INFO L290 TraceCheckUtils]: 60: Hoare triple {31428#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31428#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:18:05,698 INFO L290 TraceCheckUtils]: 59: Hoare triple {31435#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31428#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:18:05,698 INFO L290 TraceCheckUtils]: 58: Hoare triple {31435#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31435#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-28 09:18:05,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {31442#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31435#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-28 09:18:05,702 INFO L290 TraceCheckUtils]: 56: Hoare triple {31442#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31442#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,703 INFO L290 TraceCheckUtils]: 55: Hoare triple {31449#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31442#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,703 INFO L290 TraceCheckUtils]: 54: Hoare triple {31449#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31449#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,704 INFO L290 TraceCheckUtils]: 53: Hoare triple {31456#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31449#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,704 INFO L290 TraceCheckUtils]: 52: Hoare triple {31456#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31456#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-28 09:18:05,705 INFO L290 TraceCheckUtils]: 51: Hoare triple {31463#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31456#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-28 09:18:05,705 INFO L290 TraceCheckUtils]: 50: Hoare triple {31463#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31463#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-28 09:18:05,705 INFO L290 TraceCheckUtils]: 49: Hoare triple {31470#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31463#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-28 09:18:05,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {31470#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31470#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-28 09:18:05,706 INFO L290 TraceCheckUtils]: 47: Hoare triple {31477#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31470#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-28 09:18:05,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {31477#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31477#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {31484#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31477#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {31484#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31484#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {31491#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31484#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,708 INFO L290 TraceCheckUtils]: 42: Hoare triple {31491#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31491#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,709 INFO L290 TraceCheckUtils]: 41: Hoare triple {31498#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31491#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,709 INFO L290 TraceCheckUtils]: 40: Hoare triple {31498#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31498#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-28 09:18:05,709 INFO L290 TraceCheckUtils]: 39: Hoare triple {31505#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31498#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-28 09:18:05,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {31505#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31505#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-28 09:18:05,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {31512#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31505#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-28 09:18:05,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {31512#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31512#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-28 09:18:05,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {31519#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31512#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-28 09:18:05,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {31519#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31519#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-28 09:18:05,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {31526#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31519#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-28 09:18:05,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {31526#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31526#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-28 09:18:05,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {31533#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31526#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-28 09:18:05,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {31533#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31533#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {31540#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31533#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {31540#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31540#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-28 09:18:05,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {31547#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31540#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-28 09:18:05,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {31547#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31547#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-28 09:18:05,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {31554#(< (mod (+ main_~x~0 62) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31547#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-28 09:18:05,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {31554#(< (mod (+ main_~x~0 62) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31554#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-28 09:18:05,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {31561#(< (mod (+ 64 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31554#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-28 09:18:05,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {31561#(< (mod (+ 64 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31561#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {31568#(< (mod (+ 66 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31561#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {31568#(< (mod (+ 66 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31568#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {31575#(< (mod (+ 68 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31568#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {31575#(< (mod (+ 68 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31575#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {31582#(< (mod (+ main_~x~0 70) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31575#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {31582#(< (mod (+ main_~x~0 70) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31582#(< (mod (+ main_~x~0 70) 4294967296) 99)} is VALID [2022-04-28 09:18:05,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {31589#(< (mod (+ 72 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31582#(< (mod (+ main_~x~0 70) 4294967296) 99)} is VALID [2022-04-28 09:18:05,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {31589#(< (mod (+ 72 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31589#(< (mod (+ 72 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {31596#(< (mod (+ main_~x~0 74) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31589#(< (mod (+ 72 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {31596#(< (mod (+ main_~x~0 74) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31596#(< (mod (+ main_~x~0 74) 4294967296) 99)} is VALID [2022-04-28 09:18:05,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {31603#(< (mod (+ 76 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31596#(< (mod (+ main_~x~0 74) 4294967296) 99)} is VALID [2022-04-28 09:18:05,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {31603#(< (mod (+ 76 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31603#(< (mod (+ 76 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {31610#(< (mod (+ main_~x~0 78) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31603#(< (mod (+ 76 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:05,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {31610#(< (mod (+ main_~x~0 78) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31610#(< (mod (+ main_~x~0 78) 4294967296) 99)} is VALID [2022-04-28 09:18:05,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {31617#(< (mod (+ main_~x~0 80) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {31610#(< (mod (+ main_~x~0 78) 4294967296) 99)} is VALID [2022-04-28 09:18:05,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {31617#(< (mod (+ main_~x~0 80) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {31617#(< (mod (+ main_~x~0 80) 4294967296) 99)} is VALID [2022-04-28 09:18:05,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {31007#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {31617#(< (mod (+ main_~x~0 80) 4294967296) 99)} is VALID [2022-04-28 09:18:05,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {31007#true} call #t~ret6 := main(); {31007#true} is VALID [2022-04-28 09:18:05,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31007#true} {31007#true} #42#return; {31007#true} is VALID [2022-04-28 09:18:05,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {31007#true} assume true; {31007#true} is VALID [2022-04-28 09:18:05,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {31007#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(14, 2);call #Ultimate.allocInit(12, 3); {31007#true} is VALID [2022-04-28 09:18:05,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {31007#true} call ULTIMATE.init(); {31007#true} is VALID [2022-04-28 09:18:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:18:05,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113659292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:18:05,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:18:05,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-28 09:18:05,725 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:18:05,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1809705625] [2022-04-28 09:18:05,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1809705625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:18:05,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:18:05,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 09:18:05,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190837412] [2022-04-28 09:18:05,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:18:05,725 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 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 91 [2022-04-28 09:18:05,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:18:05,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:05,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:05,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 09:18:05,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:18:05,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 09:18:05,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=5905, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 09:18:05,793 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:11,412 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-04-28 09:18:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 09:18:11,412 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 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 91 [2022-04-28 09:18:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:18:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 100 transitions. [2022-04-28 09:18:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 100 transitions. [2022-04-28 09:18:11,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 100 transitions. [2022-04-28 09:18:11,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:11,464 INFO L225 Difference]: With dead ends: 100 [2022-04-28 09:18:11,464 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 09:18:11,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2834, Invalid=13168, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 09:18:11,465 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 89 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 3323 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:18:11,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 93 Invalid, 3406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3323 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 09:18:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 09:18:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-28 09:18:11,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:18:11,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:11,741 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:11,741 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:11,742 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2022-04-28 09:18:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2022-04-28 09:18:11,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:18:11,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:18:11,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 3 states have call successors, (3), 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 95 states. [2022-04-28 09:18:11,742 INFO L87 Difference]: Start difference. First operand has 94 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 3 states have call successors, (3), 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 95 states. [2022-04-28 09:18:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:11,743 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2022-04-28 09:18:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2022-04-28 09:18:11,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:18:11,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:18:11,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:18:11,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:18:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2022-04-28 09:18:11,744 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2022-04-28 09:18:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:18:11,744 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2022-04-28 09:18:11,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:11,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 94 transitions. [2022-04-28 09:18:11,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:11,888 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2022-04-28 09:18:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 09:18:11,888 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:18:11,888 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:18:11,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-28 09:18:12,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:18:12,104 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:18:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:18:12,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1798194707, now seen corresponding path program 81 times [2022-04-28 09:18:12,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:18:12,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1731028545] [2022-04-28 09:18:12,107 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:18:12,107 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:18:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1798194707, now seen corresponding path program 82 times [2022-04-28 09:18:12,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:18:12,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470327527] [2022-04-28 09:18:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:18:12,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:18:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:12,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:18:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:12,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {32348#(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(14, 2);call #Ultimate.allocInit(12, 3); {32301#true} is VALID [2022-04-28 09:18:12,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {32301#true} assume true; {32301#true} is VALID [2022-04-28 09:18:12,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32301#true} {32301#true} #42#return; {32301#true} is VALID [2022-04-28 09:18:12,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {32301#true} call ULTIMATE.init(); {32348#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:18:12,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {32348#(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(14, 2);call #Ultimate.allocInit(12, 3); {32301#true} is VALID [2022-04-28 09:18:12,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {32301#true} assume true; {32301#true} is VALID [2022-04-28 09:18:12,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32301#true} {32301#true} #42#return; {32301#true} is VALID [2022-04-28 09:18:12,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {32301#true} call #t~ret6 := main(); {32301#true} is VALID [2022-04-28 09:18:12,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {32301#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {32306#(= main_~x~0 0)} is VALID [2022-04-28 09:18:12,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {32306#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {32306#(= main_~x~0 0)} is VALID [2022-04-28 09:18:12,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {32306#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32307#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:12,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {32307#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {32307#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:12,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {32307#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32308#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:12,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {32308#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32308#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:12,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {32308#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32309#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:12,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {32309#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {32309#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:12,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {32309#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32310#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:12,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {32310#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32310#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:12,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {32310#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32311#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:12,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {32311#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32311#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:12,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {32311#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32312#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:12,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {32312#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32312#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:12,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {32312#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32313#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:12,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {32313#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {32313#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:12,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {32313#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32314#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:12,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {32314#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32314#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:12,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {32314#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32315#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:12,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {32315#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32315#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:12,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {32315#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32316#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:12,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {32316#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32316#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:12,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {32316#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32317#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:12,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {32317#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {32317#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:12,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {32317#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32318#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:12,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {32318#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32318#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:12,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {32318#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32319#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:12,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {32319#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32319#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:12,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {32319#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32320#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:12,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {32320#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {32320#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:12,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {32320#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32321#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:12,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {32321#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {32321#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:12,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {32321#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32322#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:12,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {32322#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32322#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:12,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {32322#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32323#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:12,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {32323#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32323#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:12,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {32323#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32324#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:12,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {32324#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32324#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:12,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {32324#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32325#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:12,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {32325#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32325#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:12,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {32325#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32326#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:12,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {32326#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32326#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:12,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {32326#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32327#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:12,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {32327#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32327#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:12,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {32327#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32328#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:12,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {32328#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {32328#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:12,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {32328#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32329#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:12,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {32329#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {32329#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:12,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {32329#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32330#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:12,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {32330#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32330#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:12,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {32330#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32331#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:12,943 INFO L290 TraceCheckUtils]: 56: Hoare triple {32331#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32331#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:12,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {32331#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32332#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:12,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {32332#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32332#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:12,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {32332#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32333#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:12,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {32333#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32333#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:12,945 INFO L290 TraceCheckUtils]: 61: Hoare triple {32333#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32334#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:12,945 INFO L290 TraceCheckUtils]: 62: Hoare triple {32334#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32334#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:12,945 INFO L290 TraceCheckUtils]: 63: Hoare triple {32334#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32335#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:12,946 INFO L290 TraceCheckUtils]: 64: Hoare triple {32335#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {32335#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:12,946 INFO L290 TraceCheckUtils]: 65: Hoare triple {32335#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32336#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:12,946 INFO L290 TraceCheckUtils]: 66: Hoare triple {32336#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32336#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:12,947 INFO L290 TraceCheckUtils]: 67: Hoare triple {32336#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32337#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:12,947 INFO L290 TraceCheckUtils]: 68: Hoare triple {32337#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {32337#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:12,947 INFO L290 TraceCheckUtils]: 69: Hoare triple {32337#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32338#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:12,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {32338#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32338#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:12,948 INFO L290 TraceCheckUtils]: 71: Hoare triple {32338#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32339#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:12,948 INFO L290 TraceCheckUtils]: 72: Hoare triple {32339#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {32339#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:12,949 INFO L290 TraceCheckUtils]: 73: Hoare triple {32339#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32340#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:12,949 INFO L290 TraceCheckUtils]: 74: Hoare triple {32340#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32340#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:12,949 INFO L290 TraceCheckUtils]: 75: Hoare triple {32340#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32341#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:12,949 INFO L290 TraceCheckUtils]: 76: Hoare triple {32341#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32341#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:12,950 INFO L290 TraceCheckUtils]: 77: Hoare triple {32341#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32342#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:12,950 INFO L290 TraceCheckUtils]: 78: Hoare triple {32342#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {32342#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:12,951 INFO L290 TraceCheckUtils]: 79: Hoare triple {32342#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32343#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:12,951 INFO L290 TraceCheckUtils]: 80: Hoare triple {32343#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {32343#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:12,951 INFO L290 TraceCheckUtils]: 81: Hoare triple {32343#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32344#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:12,951 INFO L290 TraceCheckUtils]: 82: Hoare triple {32344#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {32344#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:12,952 INFO L290 TraceCheckUtils]: 83: Hoare triple {32344#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32345#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:12,952 INFO L290 TraceCheckUtils]: 84: Hoare triple {32345#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {32345#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:12,953 INFO L290 TraceCheckUtils]: 85: Hoare triple {32345#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32346#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:12,953 INFO L290 TraceCheckUtils]: 86: Hoare triple {32346#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {32346#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:12,953 INFO L290 TraceCheckUtils]: 87: Hoare triple {32346#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32347#(and (<= main_~x~0 82) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:18:12,954 INFO L290 TraceCheckUtils]: 88: Hoare triple {32347#(and (<= main_~x~0 82) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {32302#false} is VALID [2022-04-28 09:18:12,954 INFO L272 TraceCheckUtils]: 89: Hoare triple {32302#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {32302#false} is VALID [2022-04-28 09:18:12,954 INFO L290 TraceCheckUtils]: 90: Hoare triple {32302#false} ~cond := #in~cond; {32302#false} is VALID [2022-04-28 09:18:12,954 INFO L290 TraceCheckUtils]: 91: Hoare triple {32302#false} assume 0 == ~cond; {32302#false} is VALID [2022-04-28 09:18:12,954 INFO L290 TraceCheckUtils]: 92: Hoare triple {32302#false} assume !false; {32302#false} is VALID [2022-04-28 09:18:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:18:12,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:18:12,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470327527] [2022-04-28 09:18:12,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470327527] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:18:12,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475418830] [2022-04-28 09:18:12,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:18:12,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:18:12,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:18:12,956 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 09:18:12,970 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 09:18:13,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:18:13,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:18:13,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-28 09:18:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:13,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:18:14,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {32301#true} call ULTIMATE.init(); {32301#true} is VALID [2022-04-28 09:18:14,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {32301#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(14, 2);call #Ultimate.allocInit(12, 3); {32301#true} is VALID [2022-04-28 09:18:14,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {32301#true} assume true; {32301#true} is VALID [2022-04-28 09:18:14,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32301#true} {32301#true} #42#return; {32301#true} is VALID [2022-04-28 09:18:14,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {32301#true} call #t~ret6 := main(); {32301#true} is VALID [2022-04-28 09:18:14,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {32301#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {32306#(= main_~x~0 0)} is VALID [2022-04-28 09:18:14,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {32306#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {32306#(= main_~x~0 0)} is VALID [2022-04-28 09:18:14,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {32306#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32373#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {32373#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32373#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {32373#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32380#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:18:14,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {32380#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume !!(~x~0 % 4294967296 < 99); {32380#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-28 09:18:14,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {32380#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32387#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {32387#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32387#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {32387#(and (= (+ main_~x~0 (- 6)) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32394#(and (= (+ main_~x~0 (- 8)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {32394#(and (= (+ main_~x~0 (- 8)) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32394#(and (= (+ main_~x~0 (- 8)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {32394#(and (= (+ main_~x~0 (- 8)) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32401#(and (= (+ main_~x~0 (- 10)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {32401#(and (= (+ main_~x~0 (- 10)) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32401#(and (= (+ main_~x~0 (- 10)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {32401#(and (= (+ main_~x~0 (- 10)) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32408#(and (= (+ main_~x~0 (- 12)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {32408#(and (= (+ main_~x~0 (- 12)) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32408#(and (= (+ main_~x~0 (- 12)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {32408#(and (= (+ main_~x~0 (- 12)) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32415#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {32415#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32415#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {32415#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32422#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {32422#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32422#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {32422#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32429#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {32429#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32429#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {32429#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32436#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {32436#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32436#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {32436#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32443#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {32443#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32443#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {32443#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32450#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {32450#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32450#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {32450#(and (= 22 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32457#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:18:14,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {32457#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 99); {32457#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:18:14,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {32457#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32464#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {32464#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32464#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {32464#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32471#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:18:14,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {32471#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32471#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:18:14,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {32471#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32478#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:18:14,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {32478#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {32478#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:18:14,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {32478#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32485#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:18:14,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {32485#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {32485#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:18:14,942 INFO L290 TraceCheckUtils]: 41: Hoare triple {32485#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32492#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,942 INFO L290 TraceCheckUtils]: 42: Hoare triple {32492#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32492#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,942 INFO L290 TraceCheckUtils]: 43: Hoare triple {32492#(and (= 34 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32499#(and (= 34 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {32499#(and (= 34 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32499#(and (= 34 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,943 INFO L290 TraceCheckUtils]: 45: Hoare triple {32499#(and (= 34 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32506#(and (= 34 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,943 INFO L290 TraceCheckUtils]: 46: Hoare triple {32506#(and (= 34 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32506#(and (= 34 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,943 INFO L290 TraceCheckUtils]: 47: Hoare triple {32506#(and (= 34 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32513#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 34))} is VALID [2022-04-28 09:18:14,943 INFO L290 TraceCheckUtils]: 48: Hoare triple {32513#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 34))} assume !!(~x~0 % 4294967296 < 99); {32513#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 34))} is VALID [2022-04-28 09:18:14,944 INFO L290 TraceCheckUtils]: 49: Hoare triple {32513#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32520#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,944 INFO L290 TraceCheckUtils]: 50: Hoare triple {32520#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32520#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,944 INFO L290 TraceCheckUtils]: 51: Hoare triple {32520#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32527#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:18:14,944 INFO L290 TraceCheckUtils]: 52: Hoare triple {32527#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {32527#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:18:14,945 INFO L290 TraceCheckUtils]: 53: Hoare triple {32527#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32534#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:18:14,945 INFO L290 TraceCheckUtils]: 54: Hoare triple {32534#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {32534#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:18:14,945 INFO L290 TraceCheckUtils]: 55: Hoare triple {32534#(and (<= (mod main_~y~0 2) 0) (= 46 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32541#(and (<= (mod main_~y~0 2) 0) (= 46 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:18:14,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {32541#(and (<= (mod main_~y~0 2) 0) (= 46 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < 99); {32541#(and (<= (mod main_~y~0 2) 0) (= 46 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:18:14,946 INFO L290 TraceCheckUtils]: 57: Hoare triple {32541#(and (<= (mod main_~y~0 2) 0) (= 46 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32548#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,946 INFO L290 TraceCheckUtils]: 58: Hoare triple {32548#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32548#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,946 INFO L290 TraceCheckUtils]: 59: Hoare triple {32548#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32555#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,946 INFO L290 TraceCheckUtils]: 60: Hoare triple {32555#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32555#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,947 INFO L290 TraceCheckUtils]: 61: Hoare triple {32555#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32562#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,947 INFO L290 TraceCheckUtils]: 62: Hoare triple {32562#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32562#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,947 INFO L290 TraceCheckUtils]: 63: Hoare triple {32562#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32569#(and (= (+ main_~x~0 (- 4)) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,948 INFO L290 TraceCheckUtils]: 64: Hoare triple {32569#(and (= (+ main_~x~0 (- 4)) 54) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32569#(and (= (+ main_~x~0 (- 4)) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,948 INFO L290 TraceCheckUtils]: 65: Hoare triple {32569#(and (= (+ main_~x~0 (- 4)) 54) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32576#(and (= (+ main_~x~0 (- 6)) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {32576#(and (= (+ main_~x~0 (- 6)) 54) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32576#(and (= (+ main_~x~0 (- 6)) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,948 INFO L290 TraceCheckUtils]: 67: Hoare triple {32576#(and (= (+ main_~x~0 (- 6)) 54) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32583#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 54))} is VALID [2022-04-28 09:18:14,949 INFO L290 TraceCheckUtils]: 68: Hoare triple {32583#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 54))} assume !!(~x~0 % 4294967296 < 99); {32583#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 54))} is VALID [2022-04-28 09:18:14,949 INFO L290 TraceCheckUtils]: 69: Hoare triple {32583#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 54))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32590#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} is VALID [2022-04-28 09:18:14,949 INFO L290 TraceCheckUtils]: 70: Hoare triple {32590#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32590#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} is VALID [2022-04-28 09:18:14,949 INFO L290 TraceCheckUtils]: 71: Hoare triple {32590#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32597#(and (= 64 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,950 INFO L290 TraceCheckUtils]: 72: Hoare triple {32597#(and (= 64 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32597#(and (= 64 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,950 INFO L290 TraceCheckUtils]: 73: Hoare triple {32597#(and (= 64 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32604#(and (<= (mod main_~y~0 2) 0) (= 68 main_~x~0))} is VALID [2022-04-28 09:18:14,950 INFO L290 TraceCheckUtils]: 74: Hoare triple {32604#(and (<= (mod main_~y~0 2) 0) (= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {32604#(and (<= (mod main_~y~0 2) 0) (= 68 main_~x~0))} is VALID [2022-04-28 09:18:14,950 INFO L290 TraceCheckUtils]: 75: Hoare triple {32604#(and (<= (mod main_~y~0 2) 0) (= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32611#(and (= 68 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,951 INFO L290 TraceCheckUtils]: 76: Hoare triple {32611#(and (= 68 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32611#(and (= 68 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,951 INFO L290 TraceCheckUtils]: 77: Hoare triple {32611#(and (= 68 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32618#(and (= 72 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,951 INFO L290 TraceCheckUtils]: 78: Hoare triple {32618#(and (= 72 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32618#(and (= 72 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,951 INFO L290 TraceCheckUtils]: 79: Hoare triple {32618#(and (= 72 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32625#(and (= main_~x~0 74) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,952 INFO L290 TraceCheckUtils]: 80: Hoare triple {32625#(and (= main_~x~0 74) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32625#(and (= main_~x~0 74) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,952 INFO L290 TraceCheckUtils]: 81: Hoare triple {32625#(and (= main_~x~0 74) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32632#(and (<= (mod main_~y~0 2) 0) (= 74 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:18:14,952 INFO L290 TraceCheckUtils]: 82: Hoare triple {32632#(and (<= (mod main_~y~0 2) 0) (= 74 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {32632#(and (<= (mod main_~y~0 2) 0) (= 74 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:18:14,952 INFO L290 TraceCheckUtils]: 83: Hoare triple {32632#(and (<= (mod main_~y~0 2) 0) (= 74 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32639#(and (= (+ main_~x~0 (- 4)) 74) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,953 INFO L290 TraceCheckUtils]: 84: Hoare triple {32639#(and (= (+ main_~x~0 (- 4)) 74) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32639#(and (= (+ main_~x~0 (- 4)) 74) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,953 INFO L290 TraceCheckUtils]: 85: Hoare triple {32639#(and (= (+ main_~x~0 (- 4)) 74) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32646#(and (= main_~x~0 80) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,953 INFO L290 TraceCheckUtils]: 86: Hoare triple {32646#(and (= main_~x~0 80) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {32646#(and (= main_~x~0 80) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,953 INFO L290 TraceCheckUtils]: 87: Hoare triple {32646#(and (= main_~x~0 80) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32653#(and (= main_~x~0 82) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,954 INFO L290 TraceCheckUtils]: 88: Hoare triple {32653#(and (= main_~x~0 82) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {32653#(and (= main_~x~0 82) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:14,954 INFO L272 TraceCheckUtils]: 89: Hoare triple {32653#(and (= main_~x~0 82) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {32660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:18:14,954 INFO L290 TraceCheckUtils]: 90: Hoare triple {32660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:18:14,955 INFO L290 TraceCheckUtils]: 91: Hoare triple {32664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {32302#false} is VALID [2022-04-28 09:18:14,955 INFO L290 TraceCheckUtils]: 92: Hoare triple {32302#false} assume !false; {32302#false} is VALID [2022-04-28 09:18:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:18:14,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:18:15,324 INFO L290 TraceCheckUtils]: 92: Hoare triple {32302#false} assume !false; {32302#false} is VALID [2022-04-28 09:18:15,325 INFO L290 TraceCheckUtils]: 91: Hoare triple {32664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {32302#false} is VALID [2022-04-28 09:18:15,325 INFO L290 TraceCheckUtils]: 90: Hoare triple {32660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:18:15,325 INFO L272 TraceCheckUtils]: 89: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {32660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:18:15,325 INFO L290 TraceCheckUtils]: 88: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,326 INFO L290 TraceCheckUtils]: 87: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,326 INFO L290 TraceCheckUtils]: 86: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,326 INFO L290 TraceCheckUtils]: 85: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,327 INFO L290 TraceCheckUtils]: 84: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,327 INFO L290 TraceCheckUtils]: 83: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,327 INFO L290 TraceCheckUtils]: 82: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,328 INFO L290 TraceCheckUtils]: 81: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,328 INFO L290 TraceCheckUtils]: 80: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,328 INFO L290 TraceCheckUtils]: 79: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,328 INFO L290 TraceCheckUtils]: 78: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,329 INFO L290 TraceCheckUtils]: 77: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,329 INFO L290 TraceCheckUtils]: 76: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,329 INFO L290 TraceCheckUtils]: 75: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,330 INFO L290 TraceCheckUtils]: 74: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,331 INFO L290 TraceCheckUtils]: 70: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,331 INFO L290 TraceCheckUtils]: 68: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,332 INFO L290 TraceCheckUtils]: 67: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,332 INFO L290 TraceCheckUtils]: 66: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,332 INFO L290 TraceCheckUtils]: 65: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,332 INFO L290 TraceCheckUtils]: 64: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,333 INFO L290 TraceCheckUtils]: 63: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,333 INFO L290 TraceCheckUtils]: 62: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,333 INFO L290 TraceCheckUtils]: 61: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,333 INFO L290 TraceCheckUtils]: 60: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,334 INFO L290 TraceCheckUtils]: 59: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,334 INFO L290 TraceCheckUtils]: 58: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,334 INFO L290 TraceCheckUtils]: 57: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,335 INFO L290 TraceCheckUtils]: 55: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,335 INFO L290 TraceCheckUtils]: 54: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,340 INFO L290 TraceCheckUtils]: 43: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,340 INFO L290 TraceCheckUtils]: 42: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,341 INFO L290 TraceCheckUtils]: 40: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {32927#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {32680#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:15,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {32927#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {32927#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:18:15,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {32301#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {32927#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:18:15,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {32301#true} call #t~ret6 := main(); {32301#true} is VALID [2022-04-28 09:18:15,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32301#true} {32301#true} #42#return; {32301#true} is VALID [2022-04-28 09:18:15,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {32301#true} assume true; {32301#true} is VALID [2022-04-28 09:18:15,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {32301#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(14, 2);call #Ultimate.allocInit(12, 3); {32301#true} is VALID [2022-04-28 09:18:15,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {32301#true} call ULTIMATE.init(); {32301#true} is VALID [2022-04-28 09:18:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2022-04-28 09:18:15,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475418830] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:18:15,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:18:15,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 6] total 90 [2022-04-28 09:18:15,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:18:15,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1731028545] [2022-04-28 09:18:15,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1731028545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:18:15,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:18:15,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 09:18:15,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625625588] [2022-04-28 09:18:15,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:18:15,352 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 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 93 [2022-04-28 09:18:15,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:18:15,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:15,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:15,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 09:18:15,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:18:15,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 09:18:15,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=7588, Unknown=0, NotChecked=0, Total=8010 [2022-04-28 09:18:15,393 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:20,781 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-04-28 09:18:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 09:18:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 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 93 [2022-04-28 09:18:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:18:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 102 transitions. [2022-04-28 09:18:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 102 transitions. [2022-04-28 09:18:20,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 102 transitions. [2022-04-28 09:18:20,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:20,863 INFO L225 Difference]: With dead ends: 102 [2022-04-28 09:18:20,864 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 09:18:20,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3652 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=713, Invalid=16579, Unknown=0, NotChecked=0, Total=17292 [2022-04-28 09:18:20,865 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 91 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 3596 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 3681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 3596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:18:20,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 203 Invalid, 3681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 3596 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 09:18:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 09:18:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2022-04-28 09:18:21,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:18:21,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 96 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:21,315 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 96 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:21,315 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 96 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:21,316 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2022-04-28 09:18:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2022-04-28 09:18:21,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:18:21,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:18:21,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 3 states have call successors, (3), 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 97 states. [2022-04-28 09:18:21,316 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 3 states have call successors, (3), 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 97 states. [2022-04-28 09:18:21,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:21,317 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2022-04-28 09:18:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2022-04-28 09:18:21,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:18:21,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:18:21,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:18:21,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:18:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2022-04-28 09:18:21,318 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2022-04-28 09:18:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:18:21,318 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2022-04-28 09:18:21,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:21,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 96 transitions. [2022-04-28 09:18:21,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:21,480 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2022-04-28 09:18:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 09:18:21,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:18:21,480 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:18:21,496 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 09:18:21,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:18:21,681 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:18:21,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:18:21,681 INFO L85 PathProgramCache]: Analyzing trace with hash -446294230, now seen corresponding path program 83 times [2022-04-28 09:18:21,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:18:21,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [576630218] [2022-04-28 09:18:21,684 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:18:21,684 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:18:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash -446294230, now seen corresponding path program 84 times [2022-04-28 09:18:21,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:18:21,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828683385] [2022-04-28 09:18:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:18:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:18:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:22,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:18:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:22,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {33673#(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(14, 2);call #Ultimate.allocInit(12, 3); {33625#true} is VALID [2022-04-28 09:18:22,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {33625#true} assume true; {33625#true} is VALID [2022-04-28 09:18:22,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33625#true} {33625#true} #42#return; {33625#true} is VALID [2022-04-28 09:18:22,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {33625#true} call ULTIMATE.init(); {33673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:18:22,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {33673#(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(14, 2);call #Ultimate.allocInit(12, 3); {33625#true} is VALID [2022-04-28 09:18:22,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {33625#true} assume true; {33625#true} is VALID [2022-04-28 09:18:22,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33625#true} {33625#true} #42#return; {33625#true} is VALID [2022-04-28 09:18:22,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {33625#true} call #t~ret6 := main(); {33625#true} is VALID [2022-04-28 09:18:22,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {33625#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {33630#(= main_~x~0 0)} is VALID [2022-04-28 09:18:22,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {33630#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {33630#(= main_~x~0 0)} is VALID [2022-04-28 09:18:22,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {33630#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33631#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:22,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {33631#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {33631#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:22,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {33631#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33632#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:22,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {33632#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33632#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:22,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {33632#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33633#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:22,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {33633#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {33633#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:22,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {33633#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33634#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:22,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {33634#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33634#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:22,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {33634#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:22,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {33635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:22,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {33635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33636#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:22,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {33636#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33636#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:22,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {33636#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33637#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:22,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {33637#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {33637#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:22,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {33637#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33638#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:22,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {33638#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33638#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:22,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {33638#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33639#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:22,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {33639#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33639#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:22,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {33639#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33640#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:22,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {33640#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33640#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:22,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {33640#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33641#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:22,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {33641#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {33641#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:22,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {33641#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33642#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:22,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {33642#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33642#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:22,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {33642#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33643#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:22,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {33643#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33643#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:22,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {33643#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33644#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:22,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {33644#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {33644#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:22,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {33644#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33645#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:22,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {33645#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {33645#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:22,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {33645#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33646#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:22,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {33646#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33646#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:22,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {33646#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33647#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:22,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {33647#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33647#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:22,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {33647#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33648#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:22,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {33648#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33648#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:22,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {33648#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33649#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:22,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {33649#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33649#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:22,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {33649#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33650#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:22,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {33650#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33650#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:22,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {33650#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33651#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:22,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {33651#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33651#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:22,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {33651#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33652#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:22,675 INFO L290 TraceCheckUtils]: 50: Hoare triple {33652#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {33652#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:22,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {33652#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33653#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:22,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {33653#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {33653#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:22,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {33653#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33654#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:22,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {33654#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33654#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:22,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {33654#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33655#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:22,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {33655#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33655#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:22,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {33655#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33656#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:22,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {33656#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33656#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:22,678 INFO L290 TraceCheckUtils]: 59: Hoare triple {33656#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33657#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:22,679 INFO L290 TraceCheckUtils]: 60: Hoare triple {33657#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33657#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:22,679 INFO L290 TraceCheckUtils]: 61: Hoare triple {33657#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33658#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:22,679 INFO L290 TraceCheckUtils]: 62: Hoare triple {33658#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33658#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:22,680 INFO L290 TraceCheckUtils]: 63: Hoare triple {33658#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33659#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:22,680 INFO L290 TraceCheckUtils]: 64: Hoare triple {33659#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {33659#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:22,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {33659#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33660#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:22,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {33660#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33660#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:22,681 INFO L290 TraceCheckUtils]: 67: Hoare triple {33660#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33661#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:22,682 INFO L290 TraceCheckUtils]: 68: Hoare triple {33661#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {33661#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:22,682 INFO L290 TraceCheckUtils]: 69: Hoare triple {33661#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33662#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:22,683 INFO L290 TraceCheckUtils]: 70: Hoare triple {33662#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33662#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:22,683 INFO L290 TraceCheckUtils]: 71: Hoare triple {33662#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33663#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:22,683 INFO L290 TraceCheckUtils]: 72: Hoare triple {33663#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {33663#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:22,684 INFO L290 TraceCheckUtils]: 73: Hoare triple {33663#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33664#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:22,684 INFO L290 TraceCheckUtils]: 74: Hoare triple {33664#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33664#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:22,685 INFO L290 TraceCheckUtils]: 75: Hoare triple {33664#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33665#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:22,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {33665#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33665#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:22,685 INFO L290 TraceCheckUtils]: 77: Hoare triple {33665#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33666#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:22,686 INFO L290 TraceCheckUtils]: 78: Hoare triple {33666#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {33666#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:22,686 INFO L290 TraceCheckUtils]: 79: Hoare triple {33666#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33667#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:22,686 INFO L290 TraceCheckUtils]: 80: Hoare triple {33667#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {33667#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:22,687 INFO L290 TraceCheckUtils]: 81: Hoare triple {33667#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33668#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:22,687 INFO L290 TraceCheckUtils]: 82: Hoare triple {33668#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {33668#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:22,688 INFO L290 TraceCheckUtils]: 83: Hoare triple {33668#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33669#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:22,688 INFO L290 TraceCheckUtils]: 84: Hoare triple {33669#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {33669#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:22,689 INFO L290 TraceCheckUtils]: 85: Hoare triple {33669#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33670#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:22,689 INFO L290 TraceCheckUtils]: 86: Hoare triple {33670#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {33670#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:22,689 INFO L290 TraceCheckUtils]: 87: Hoare triple {33670#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33671#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:18:22,690 INFO L290 TraceCheckUtils]: 88: Hoare triple {33671#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {33671#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:18:22,690 INFO L290 TraceCheckUtils]: 89: Hoare triple {33671#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33672#(and (<= main_~x~0 84) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:18:22,691 INFO L290 TraceCheckUtils]: 90: Hoare triple {33672#(and (<= main_~x~0 84) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {33626#false} is VALID [2022-04-28 09:18:22,691 INFO L272 TraceCheckUtils]: 91: Hoare triple {33626#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {33626#false} is VALID [2022-04-28 09:18:22,691 INFO L290 TraceCheckUtils]: 92: Hoare triple {33626#false} ~cond := #in~cond; {33626#false} is VALID [2022-04-28 09:18:22,691 INFO L290 TraceCheckUtils]: 93: Hoare triple {33626#false} assume 0 == ~cond; {33626#false} is VALID [2022-04-28 09:18:22,691 INFO L290 TraceCheckUtils]: 94: Hoare triple {33626#false} assume !false; {33626#false} is VALID [2022-04-28 09:18:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:18:22,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:18:22,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828683385] [2022-04-28 09:18:22,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828683385] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:18:22,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347703420] [2022-04-28 09:18:22,692 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:18:22,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:18:22,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:18:22,693 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 09:18:22,694 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 09:18:29,530 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2022-04-28 09:18:29,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:18:29,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 93 conjunts are in the unsatisfiable core [2022-04-28 09:18:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:29,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:18:30,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {33625#true} call ULTIMATE.init(); {33625#true} is VALID [2022-04-28 09:18:30,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {33625#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(14, 2);call #Ultimate.allocInit(12, 3); {33625#true} is VALID [2022-04-28 09:18:30,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {33625#true} assume true; {33625#true} is VALID [2022-04-28 09:18:30,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33625#true} {33625#true} #42#return; {33625#true} is VALID [2022-04-28 09:18:30,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {33625#true} call #t~ret6 := main(); {33625#true} is VALID [2022-04-28 09:18:30,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {33625#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {33630#(= main_~x~0 0)} is VALID [2022-04-28 09:18:30,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {33630#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {33630#(= main_~x~0 0)} is VALID [2022-04-28 09:18:30,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {33630#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33631#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:30,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {33631#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {33631#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:30,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {33631#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33632#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:30,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {33632#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33632#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:30,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {33632#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33633#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:30,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {33633#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {33633#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:30,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {33633#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33634#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:30,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {33634#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33634#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:30,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {33634#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:30,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {33635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:30,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {33635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33636#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:30,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {33636#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33636#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:30,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {33636#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33637#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:30,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {33637#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {33637#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:30,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {33637#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33638#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:30,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {33638#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33638#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:30,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {33638#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33639#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:30,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {33639#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33639#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:30,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {33639#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33640#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:30,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {33640#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33640#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:30,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {33640#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33641#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:30,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {33641#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {33641#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:30,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {33641#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33642#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:30,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {33642#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33642#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:30,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {33642#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33643#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:30,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {33643#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33643#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:30,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {33643#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33644#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:30,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {33644#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {33644#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:30,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {33644#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33645#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:30,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {33645#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {33645#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:30,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {33645#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33646#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:30,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {33646#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33646#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:30,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {33646#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33647#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:30,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {33647#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33647#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:30,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {33647#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33648#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:30,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {33648#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33648#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:30,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {33648#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33649#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:30,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {33649#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33649#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:30,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {33649#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33650#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:30,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {33650#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33650#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:30,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {33650#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33818#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,947 INFO L290 TraceCheckUtils]: 48: Hoare triple {33818#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {33818#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {33818#(and (<= main_~x~0 42) (<= 42 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33825#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:30,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {33825#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {33825#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:30,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {33825#(and (<= 44 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33832#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:30,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {33832#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {33832#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:30,948 INFO L290 TraceCheckUtils]: 53: Hoare triple {33832#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33839#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:30,949 INFO L290 TraceCheckUtils]: 54: Hoare triple {33839#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33839#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:30,949 INFO L290 TraceCheckUtils]: 55: Hoare triple {33839#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33846#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,949 INFO L290 TraceCheckUtils]: 56: Hoare triple {33846#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {33846#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,950 INFO L290 TraceCheckUtils]: 57: Hoare triple {33846#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33853#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,950 INFO L290 TraceCheckUtils]: 58: Hoare triple {33853#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {33853#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,950 INFO L290 TraceCheckUtils]: 59: Hoare triple {33853#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33860#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:30,950 INFO L290 TraceCheckUtils]: 60: Hoare triple {33860#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33860#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:30,951 INFO L290 TraceCheckUtils]: 61: Hoare triple {33860#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33867#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:30,951 INFO L290 TraceCheckUtils]: 62: Hoare triple {33867#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33867#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:30,952 INFO L290 TraceCheckUtils]: 63: Hoare triple {33867#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33874#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:30,952 INFO L290 TraceCheckUtils]: 64: Hoare triple {33874#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {33874#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:30,952 INFO L290 TraceCheckUtils]: 65: Hoare triple {33874#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33881#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,952 INFO L290 TraceCheckUtils]: 66: Hoare triple {33881#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {33881#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,953 INFO L290 TraceCheckUtils]: 67: Hoare triple {33881#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33888#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:30,953 INFO L290 TraceCheckUtils]: 68: Hoare triple {33888#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {33888#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:30,954 INFO L290 TraceCheckUtils]: 69: Hoare triple {33888#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33895#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,954 INFO L290 TraceCheckUtils]: 70: Hoare triple {33895#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {33895#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,954 INFO L290 TraceCheckUtils]: 71: Hoare triple {33895#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33902#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:30,954 INFO L290 TraceCheckUtils]: 72: Hoare triple {33902#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {33902#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:30,955 INFO L290 TraceCheckUtils]: 73: Hoare triple {33902#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33909#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,955 INFO L290 TraceCheckUtils]: 74: Hoare triple {33909#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {33909#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,956 INFO L290 TraceCheckUtils]: 75: Hoare triple {33909#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33916#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:30,956 INFO L290 TraceCheckUtils]: 76: Hoare triple {33916#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {33916#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:30,956 INFO L290 TraceCheckUtils]: 77: Hoare triple {33916#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33923#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:30,957 INFO L290 TraceCheckUtils]: 78: Hoare triple {33923#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {33923#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:30,957 INFO L290 TraceCheckUtils]: 79: Hoare triple {33923#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33930#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:30,957 INFO L290 TraceCheckUtils]: 80: Hoare triple {33930#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {33930#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:30,958 INFO L290 TraceCheckUtils]: 81: Hoare triple {33930#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33937#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,958 INFO L290 TraceCheckUtils]: 82: Hoare triple {33937#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {33937#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,958 INFO L290 TraceCheckUtils]: 83: Hoare triple {33937#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33944#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:30,958 INFO L290 TraceCheckUtils]: 84: Hoare triple {33944#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {33944#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:30,959 INFO L290 TraceCheckUtils]: 85: Hoare triple {33944#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33951#(and (<= 80 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:30,963 INFO L290 TraceCheckUtils]: 86: Hoare triple {33951#(and (<= 80 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {33951#(and (<= 80 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:30,964 INFO L290 TraceCheckUtils]: 87: Hoare triple {33951#(and (<= 80 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33958#(and (<= 82 main_~x~0) (<= main_~x~0 82) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,964 INFO L290 TraceCheckUtils]: 88: Hoare triple {33958#(and (<= 82 main_~x~0) (<= main_~x~0 82) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {33958#(and (<= 82 main_~x~0) (<= main_~x~0 82) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,964 INFO L290 TraceCheckUtils]: 89: Hoare triple {33958#(and (<= 82 main_~x~0) (<= main_~x~0 82) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33965#(and (<= 84 main_~x~0) (<= main_~x~0 84) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:18:30,965 INFO L290 TraceCheckUtils]: 90: Hoare triple {33965#(and (<= 84 main_~x~0) (<= main_~x~0 84) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {33626#false} is VALID [2022-04-28 09:18:30,965 INFO L272 TraceCheckUtils]: 91: Hoare triple {33626#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {33626#false} is VALID [2022-04-28 09:18:30,965 INFO L290 TraceCheckUtils]: 92: Hoare triple {33626#false} ~cond := #in~cond; {33626#false} is VALID [2022-04-28 09:18:30,965 INFO L290 TraceCheckUtils]: 93: Hoare triple {33626#false} assume 0 == ~cond; {33626#false} is VALID [2022-04-28 09:18:30,965 INFO L290 TraceCheckUtils]: 94: Hoare triple {33626#false} assume !false; {33626#false} is VALID [2022-04-28 09:18:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:18:30,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:18:40,904 INFO L290 TraceCheckUtils]: 94: Hoare triple {33626#false} assume !false; {33626#false} is VALID [2022-04-28 09:18:40,905 INFO L290 TraceCheckUtils]: 93: Hoare triple {33984#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33626#false} is VALID [2022-04-28 09:18:40,905 INFO L290 TraceCheckUtils]: 92: Hoare triple {33988#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33984#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:18:40,906 INFO L272 TraceCheckUtils]: 91: Hoare triple {33992#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {33988#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:18:40,906 INFO L290 TraceCheckUtils]: 90: Hoare triple {33996#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !(~x~0 % 4294967296 < 99); {33992#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:18:40,907 INFO L290 TraceCheckUtils]: 89: Hoare triple {34000#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {33996#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,907 INFO L290 TraceCheckUtils]: 88: Hoare triple {34000#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34000#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-28 09:18:40,908 INFO L290 TraceCheckUtils]: 87: Hoare triple {34007#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34000#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-28 09:18:40,908 INFO L290 TraceCheckUtils]: 86: Hoare triple {34007#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {34007#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,910 INFO L290 TraceCheckUtils]: 85: Hoare triple {34014#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34007#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,910 INFO L290 TraceCheckUtils]: 84: Hoare triple {34014#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {34014#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,911 INFO L290 TraceCheckUtils]: 83: Hoare triple {34021#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34014#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,911 INFO L290 TraceCheckUtils]: 82: Hoare triple {34021#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {34021#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,912 INFO L290 TraceCheckUtils]: 81: Hoare triple {34028#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34021#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,913 INFO L290 TraceCheckUtils]: 80: Hoare triple {34028#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34028#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-28 09:18:40,913 INFO L290 TraceCheckUtils]: 79: Hoare triple {34035#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34028#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-28 09:18:40,914 INFO L290 TraceCheckUtils]: 78: Hoare triple {34039#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod main_~x~0 4294967296) 99)) (< (mod (+ main_~x~0 12) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34035#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-28 09:18:40,914 INFO L290 TraceCheckUtils]: 77: Hoare triple {34043#(or (not (< (mod (+ main_~x~0 2) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34039#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod main_~x~0 4294967296) 99)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-28 09:18:40,915 INFO L290 TraceCheckUtils]: 76: Hoare triple {34043#(or (not (< (mod (+ main_~x~0 2) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34043#(or (not (< (mod (+ main_~x~0 2) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-28 09:18:40,916 INFO L290 TraceCheckUtils]: 75: Hoare triple {34050#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 4) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34043#(or (not (< (mod (+ main_~x~0 2) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-28 09:18:40,916 INFO L290 TraceCheckUtils]: 74: Hoare triple {34050#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 4) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {34050#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 4) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,917 INFO L290 TraceCheckUtils]: 73: Hoare triple {34057#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 6) 4294967296) 99)) (< (mod (+ main_~x~0 18) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34050#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 4) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,917 INFO L290 TraceCheckUtils]: 72: Hoare triple {34057#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 6) 4294967296) 99)) (< (mod (+ main_~x~0 18) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34057#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 6) 4294967296) 99)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-28 09:18:40,918 INFO L290 TraceCheckUtils]: 71: Hoare triple {34064#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (not (< (mod (+ main_~x~0 8) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34057#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 6) 4294967296) 99)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-28 09:18:40,919 INFO L290 TraceCheckUtils]: 70: Hoare triple {34064#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (not (< (mod (+ main_~x~0 8) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {34064#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (not (< (mod (+ main_~x~0 8) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,920 INFO L290 TraceCheckUtils]: 69: Hoare triple {34071#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (not (< (mod (+ main_~x~0 10) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34064#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (not (< (mod (+ main_~x~0 8) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,920 INFO L290 TraceCheckUtils]: 68: Hoare triple {34071#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (not (< (mod (+ main_~x~0 10) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {34071#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (not (< (mod (+ main_~x~0 10) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,921 INFO L290 TraceCheckUtils]: 67: Hoare triple {34078#(or (not (< (mod (+ main_~x~0 12) 4294967296) 99)) (< (mod (+ main_~x~0 24) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34071#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (not (< (mod (+ main_~x~0 10) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,921 INFO L290 TraceCheckUtils]: 66: Hoare triple {34078#(or (not (< (mod (+ main_~x~0 12) 4294967296) 99)) (< (mod (+ main_~x~0 24) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {34078#(or (not (< (mod (+ main_~x~0 12) 4294967296) 99)) (< (mod (+ main_~x~0 24) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,922 INFO L290 TraceCheckUtils]: 65: Hoare triple {34085#(or (not (< (mod (+ main_~x~0 14) 4294967296) 99)) (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34078#(or (not (< (mod (+ main_~x~0 12) 4294967296) 99)) (< (mod (+ main_~x~0 24) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,923 INFO L290 TraceCheckUtils]: 64: Hoare triple {34085#(or (not (< (mod (+ main_~x~0 14) 4294967296) 99)) (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {34085#(or (not (< (mod (+ main_~x~0 14) 4294967296) 99)) (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {34092#(or (not (< (mod (+ main_~x~0 16) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34085#(or (not (< (mod (+ main_~x~0 14) 4294967296) 99)) (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {34092#(or (not (< (mod (+ main_~x~0 16) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34092#(or (not (< (mod (+ main_~x~0 16) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-28 09:18:40,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {34099#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 18) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34092#(or (not (< (mod (+ main_~x~0 16) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-28 09:18:40,925 INFO L290 TraceCheckUtils]: 60: Hoare triple {34099#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 18) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {34099#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 18) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,926 INFO L290 TraceCheckUtils]: 59: Hoare triple {34106#(or (not (< (mod (+ main_~x~0 20) 4294967296) 99)) (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34099#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 18) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,927 INFO L290 TraceCheckUtils]: 58: Hoare triple {34106#(or (not (< (mod (+ main_~x~0 20) 4294967296) 99)) (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {34106#(or (not (< (mod (+ main_~x~0 20) 4294967296) 99)) (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {34113#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (not (< (mod (+ main_~x~0 22) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34106#(or (not (< (mod (+ main_~x~0 20) 4294967296) 99)) (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {34113#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (not (< (mod (+ main_~x~0 22) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {34113#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (not (< (mod (+ main_~x~0 22) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,953 INFO L290 TraceCheckUtils]: 55: Hoare triple {34120#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 24) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34113#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (not (< (mod (+ main_~x~0 22) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,953 INFO L290 TraceCheckUtils]: 54: Hoare triple {34120#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 24) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {34120#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 24) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,954 INFO L290 TraceCheckUtils]: 53: Hoare triple {34127#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (not (< (mod (+ main_~x~0 26) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34120#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 24) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {34127#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (not (< (mod (+ main_~x~0 26) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {34127#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (not (< (mod (+ main_~x~0 26) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,955 INFO L290 TraceCheckUtils]: 51: Hoare triple {34134#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 28) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34127#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (not (< (mod (+ main_~x~0 26) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:18:40,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {34134#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 28) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {34134#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 28) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,969 INFO L290 TraceCheckUtils]: 49: Hoare triple {34141#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34134#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)) (not (< (mod (+ main_~x~0 28) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {34141#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34141#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:18:40,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {34148#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 44 main_~x~0) 4294967296) 99) (not (< (mod (+ 32 main_~x~0) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34141#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 99)) (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:18:40,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {34148#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 44 main_~x~0) 4294967296) 99) (not (< (mod (+ 32 main_~x~0) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {34148#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 44 main_~x~0) 4294967296) 99) (not (< (mod (+ 32 main_~x~0) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,972 INFO L290 TraceCheckUtils]: 45: Hoare triple {34155#(or (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 34) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34148#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 44 main_~x~0) 4294967296) 99) (not (< (mod (+ 32 main_~x~0) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,972 INFO L290 TraceCheckUtils]: 44: Hoare triple {34155#(or (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 34) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {34155#(or (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 34) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {34162#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (not (< (mod (+ main_~x~0 36) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34155#(or (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 34) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {34162#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (not (< (mod (+ main_~x~0 36) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {34162#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (not (< (mod (+ main_~x~0 36) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:18:40,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {34169#(or (not (< (mod (+ main_~x~0 38) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34162#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (not (< (mod (+ main_~x~0 36) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:18:40,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {34169#(or (not (< (mod (+ main_~x~0 38) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34169#(or (not (< (mod (+ main_~x~0 38) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99))} is VALID [2022-04-28 09:18:40,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {34176#(or (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ 40 main_~x~0) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34169#(or (not (< (mod (+ main_~x~0 38) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99))} is VALID [2022-04-28 09:18:40,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {34176#(or (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ 40 main_~x~0) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {34176#(or (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ 40 main_~x~0) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {34183#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (not (< (mod (+ 42 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34176#(or (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ 40 main_~x~0) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {34183#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (not (< (mod (+ 42 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {34183#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (not (< (mod (+ 42 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:18:40,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {34190#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (not (< (mod (+ 44 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34183#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (not (< (mod (+ 42 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:18:40,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {34190#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (not (< (mod (+ 44 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {34190#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (not (< (mod (+ 44 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:18:40,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {34197#(or (not (< (mod (+ main_~x~0 46) 4294967296) 99)) (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34190#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (not (< (mod (+ 44 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:18:40,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {34197#(or (not (< (mod (+ main_~x~0 46) 4294967296) 99)) (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {34197#(or (not (< (mod (+ main_~x~0 46) 4294967296) 99)) (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:18:40,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {34204#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 48) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34197#(or (not (< (mod (+ main_~x~0 46) 4294967296) 99)) (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:18:40,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {34204#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 48) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {34204#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 48) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {34211#(or (not (< (mod (+ main_~x~0 50) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34204#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 48) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {34211#(or (not (< (mod (+ main_~x~0 50) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34211#(or (not (< (mod (+ main_~x~0 50) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} is VALID [2022-04-28 09:18:40,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {34218#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 52) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34211#(or (not (< (mod (+ main_~x~0 50) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} is VALID [2022-04-28 09:18:40,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {34218#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 52) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {34218#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 52) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {34225#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 54) 4294967296) 99)) (< (mod (+ 66 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34218#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 52) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {34225#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 54) 4294967296) 99)) (< (mod (+ 66 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34225#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 54) 4294967296) 99)) (< (mod (+ 66 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:18:40,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {34232#(or (not (< (mod (+ 56 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34225#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 54) 4294967296) 99)) (< (mod (+ 66 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:18:40,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {34232#(or (not (< (mod (+ 56 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34232#(or (not (< (mod (+ 56 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:18:40,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {34239#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 58) 4294967296) 99)) (< (mod (+ main_~x~0 70) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34232#(or (not (< (mod (+ 56 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:18:40,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {34239#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 58) 4294967296) 99)) (< (mod (+ main_~x~0 70) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34239#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 58) 4294967296) 99)) (< (mod (+ main_~x~0 70) 4294967296) 99))} is VALID [2022-04-28 09:18:40,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {34246#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 60) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34239#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 58) 4294967296) 99)) (< (mod (+ main_~x~0 70) 4294967296) 99))} is VALID [2022-04-28 09:18:40,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {34246#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 60) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {34246#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 60) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:18:40,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {34253#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 62) 4294967296) 99)) (< (mod (+ main_~x~0 74) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34246#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (not (< (mod (+ main_~x~0 60) 4294967296) 99)) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:18:40,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {34253#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 62) 4294967296) 99)) (< (mod (+ main_~x~0 74) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34253#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 62) 4294967296) 99)) (< (mod (+ main_~x~0 74) 4294967296) 99))} is VALID [2022-04-28 09:18:40,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {34260#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34253#(or (<= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 62) 4294967296) 99)) (< (mod (+ main_~x~0 74) 4294967296) 99))} is VALID [2022-04-28 09:18:40,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {34260#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34260#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:18:40,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {34267#(or (not (< (mod (+ 66 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 78) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34260#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:18:40,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {34267#(or (not (< (mod (+ 66 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 78) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {34267#(or (not (< (mod (+ 66 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 78) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:18:40,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {34274#(or (< (mod (+ main_~x~0 80) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ 68 main_~x~0) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34267#(or (not (< (mod (+ 66 main_~x~0) 4294967296) 99)) (< (mod (+ main_~x~0 78) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:18:40,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {34274#(or (< (mod (+ main_~x~0 80) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ 68 main_~x~0) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {34274#(or (< (mod (+ main_~x~0 80) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ 68 main_~x~0) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {34281#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 82) 4294967296) 99) (not (< (mod (+ main_~x~0 70) 4294967296) 99)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34274#(or (< (mod (+ main_~x~0 80) 4294967296) 99) (<= (mod main_~x~0 2) 0) (not (< (mod (+ 68 main_~x~0) 4294967296) 99)))} is VALID [2022-04-28 09:18:40,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {34281#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 82) 4294967296) 99) (not (< (mod (+ main_~x~0 70) 4294967296) 99)))} assume !!(~x~0 % 4294967296 < 99); {34281#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 82) 4294967296) 99) (not (< (mod (+ main_~x~0 70) 4294967296) 99)))} is VALID [2022-04-28 09:18:41,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {34288#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 84 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {34281#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 82) 4294967296) 99) (not (< (mod (+ main_~x~0 70) 4294967296) 99)))} is VALID [2022-04-28 09:18:41,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {34288#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 84 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {34288#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 84 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:18:41,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {33625#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {34288#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 99)) (<= (mod main_~x~0 2) 0) (< (mod (+ 84 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:18:41,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {33625#true} call #t~ret6 := main(); {33625#true} is VALID [2022-04-28 09:18:41,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33625#true} {33625#true} #42#return; {33625#true} is VALID [2022-04-28 09:18:41,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {33625#true} assume true; {33625#true} is VALID [2022-04-28 09:18:41,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {33625#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(14, 2);call #Ultimate.allocInit(12, 3); {33625#true} is VALID [2022-04-28 09:18:41,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {33625#true} call ULTIMATE.init(); {33625#true} is VALID [2022-04-28 09:18:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:18:41,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347703420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:18:41,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:18:41,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 49] total 115 [2022-04-28 09:18:41,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:18:41,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [576630218] [2022-04-28 09:18:41,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [576630218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:18:41,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:18:41,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 09:18:41,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982071427] [2022-04-28 09:18:41,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:18:41,004 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 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 95 [2022-04-28 09:18:41,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:18:41,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:41,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:41,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 09:18:41,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:18:41,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 09:18:41,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3120, Invalid=9990, Unknown=0, NotChecked=0, Total=13110 [2022-04-28 09:18:41,105 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:46,242 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-28 09:18:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 09:18:46,243 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 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 95 [2022-04-28 09:18:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:18:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 104 transitions. [2022-04-28 09:18:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 104 transitions. [2022-04-28 09:18:46,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 104 transitions. [2022-04-28 09:18:46,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:46,296 INFO L225 Difference]: With dead ends: 104 [2022-04-28 09:18:46,296 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 09:18:46,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4736 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=5170, Invalid=19636, Unknown=0, NotChecked=0, Total=24806 [2022-04-28 09:18:46,297 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 93 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3773 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 3860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:18:46,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 213 Invalid, 3860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3773 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 09:18:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 09:18:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2022-04-28 09:18:46,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:18:46,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 98 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:46,605 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 98 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:46,605 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 98 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:46,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:46,606 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2022-04-28 09:18:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-04-28 09:18:46,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:18:46,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:18:46,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 3 states have call successors, (3), 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 99 states. [2022-04-28 09:18:46,606 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 3 states have call successors, (3), 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 99 states. [2022-04-28 09:18:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:46,607 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2022-04-28 09:18:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-04-28 09:18:46,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:18:46,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:18:46,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:18:46,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:18:46,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.010752688172043) internal successors, (94), 93 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2022-04-28 09:18:46,608 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2022-04-28 09:18:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:18:46,609 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2022-04-28 09:18:46,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:46,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 98 transitions. [2022-04-28 09:18:46,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2022-04-28 09:18:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 09:18:46,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:18:46,750 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:18:46,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-04-28 09:18:46,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:18:46,957 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:18:46,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:18:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1649940775, now seen corresponding path program 85 times [2022-04-28 09:18:46,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:18:46,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1413538450] [2022-04-28 09:18:46,960 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:18:46,960 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:18:46,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1649940775, now seen corresponding path program 86 times [2022-04-28 09:18:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:18:46,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212820248] [2022-04-28 09:18:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:18:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:18:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:18:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:47,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {35049#(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(14, 2);call #Ultimate.allocInit(12, 3); {35000#true} is VALID [2022-04-28 09:18:47,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {35000#true} assume true; {35000#true} is VALID [2022-04-28 09:18:47,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35000#true} {35000#true} #42#return; {35000#true} is VALID [2022-04-28 09:18:47,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {35000#true} call ULTIMATE.init(); {35049#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:18:47,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {35049#(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(14, 2);call #Ultimate.allocInit(12, 3); {35000#true} is VALID [2022-04-28 09:18:47,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {35000#true} assume true; {35000#true} is VALID [2022-04-28 09:18:47,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35000#true} {35000#true} #42#return; {35000#true} is VALID [2022-04-28 09:18:47,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {35000#true} call #t~ret6 := main(); {35000#true} is VALID [2022-04-28 09:18:47,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {35000#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {35005#(= main_~x~0 0)} is VALID [2022-04-28 09:18:47,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {35005#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {35005#(= main_~x~0 0)} is VALID [2022-04-28 09:18:47,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {35005#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35006#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:47,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {35006#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {35006#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:47,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {35006#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:47,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {35007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:47,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {35007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35008#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:47,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {35008#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {35008#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:47,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {35008#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35009#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:47,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {35009#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35009#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:47,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {35009#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:47,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {35010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:47,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {35010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35011#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:47,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {35011#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35011#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:47,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {35011#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35012#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:47,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {35012#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {35012#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:47,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {35012#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35013#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:47,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {35013#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35013#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:47,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {35013#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35014#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:47,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {35014#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35014#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:47,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {35014#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35015#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:47,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {35015#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35015#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:47,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {35015#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35016#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:47,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {35016#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {35016#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:47,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {35016#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35017#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:47,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {35017#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35017#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:47,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {35017#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35018#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:47,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {35018#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35018#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:47,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {35018#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35019#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:47,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {35019#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {35019#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:47,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {35019#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35020#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:47,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {35020#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {35020#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:47,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {35020#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35021#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:47,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {35021#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35021#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:47,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {35021#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35022#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:47,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {35022#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35022#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:47,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {35022#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35023#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:47,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {35023#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35023#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:47,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {35023#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35024#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:47,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {35024#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35024#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:47,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {35024#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35025#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:47,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {35025#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35025#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:47,805 INFO L290 TraceCheckUtils]: 47: Hoare triple {35025#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35026#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:47,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {35026#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35026#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:47,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {35026#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35027#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:47,806 INFO L290 TraceCheckUtils]: 50: Hoare triple {35027#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {35027#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:47,806 INFO L290 TraceCheckUtils]: 51: Hoare triple {35027#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35028#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:47,806 INFO L290 TraceCheckUtils]: 52: Hoare triple {35028#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {35028#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:47,807 INFO L290 TraceCheckUtils]: 53: Hoare triple {35028#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35029#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:47,807 INFO L290 TraceCheckUtils]: 54: Hoare triple {35029#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35029#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:47,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {35029#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35030#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:47,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {35030#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35030#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:47,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {35030#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35031#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:47,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {35031#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35031#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:47,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {35031#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35032#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:47,809 INFO L290 TraceCheckUtils]: 60: Hoare triple {35032#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35032#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:47,809 INFO L290 TraceCheckUtils]: 61: Hoare triple {35032#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35033#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:47,809 INFO L290 TraceCheckUtils]: 62: Hoare triple {35033#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35033#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:47,809 INFO L290 TraceCheckUtils]: 63: Hoare triple {35033#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35034#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:47,810 INFO L290 TraceCheckUtils]: 64: Hoare triple {35034#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {35034#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:47,810 INFO L290 TraceCheckUtils]: 65: Hoare triple {35034#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35035#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:47,810 INFO L290 TraceCheckUtils]: 66: Hoare triple {35035#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35035#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:47,811 INFO L290 TraceCheckUtils]: 67: Hoare triple {35035#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35036#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:47,811 INFO L290 TraceCheckUtils]: 68: Hoare triple {35036#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {35036#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:47,811 INFO L290 TraceCheckUtils]: 69: Hoare triple {35036#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35037#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:47,811 INFO L290 TraceCheckUtils]: 70: Hoare triple {35037#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35037#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:47,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {35037#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35038#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:47,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {35038#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {35038#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:47,812 INFO L290 TraceCheckUtils]: 73: Hoare triple {35038#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35039#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:47,813 INFO L290 TraceCheckUtils]: 74: Hoare triple {35039#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35039#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:47,813 INFO L290 TraceCheckUtils]: 75: Hoare triple {35039#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35040#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:47,813 INFO L290 TraceCheckUtils]: 76: Hoare triple {35040#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35040#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:47,813 INFO L290 TraceCheckUtils]: 77: Hoare triple {35040#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35041#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:47,814 INFO L290 TraceCheckUtils]: 78: Hoare triple {35041#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {35041#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:47,814 INFO L290 TraceCheckUtils]: 79: Hoare triple {35041#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35042#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:47,814 INFO L290 TraceCheckUtils]: 80: Hoare triple {35042#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {35042#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:47,815 INFO L290 TraceCheckUtils]: 81: Hoare triple {35042#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35043#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:47,815 INFO L290 TraceCheckUtils]: 82: Hoare triple {35043#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {35043#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:47,815 INFO L290 TraceCheckUtils]: 83: Hoare triple {35043#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35044#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:47,815 INFO L290 TraceCheckUtils]: 84: Hoare triple {35044#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {35044#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:47,816 INFO L290 TraceCheckUtils]: 85: Hoare triple {35044#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35045#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:47,816 INFO L290 TraceCheckUtils]: 86: Hoare triple {35045#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {35045#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:47,816 INFO L290 TraceCheckUtils]: 87: Hoare triple {35045#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35046#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:18:47,817 INFO L290 TraceCheckUtils]: 88: Hoare triple {35046#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {35046#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:18:47,817 INFO L290 TraceCheckUtils]: 89: Hoare triple {35046#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35047#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:18:47,817 INFO L290 TraceCheckUtils]: 90: Hoare triple {35047#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 99); {35047#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:18:47,818 INFO L290 TraceCheckUtils]: 91: Hoare triple {35047#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35048#(and (<= main_~x~0 86) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:18:47,818 INFO L290 TraceCheckUtils]: 92: Hoare triple {35048#(and (<= main_~x~0 86) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {35001#false} is VALID [2022-04-28 09:18:47,818 INFO L272 TraceCheckUtils]: 93: Hoare triple {35001#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {35001#false} is VALID [2022-04-28 09:18:47,818 INFO L290 TraceCheckUtils]: 94: Hoare triple {35001#false} ~cond := #in~cond; {35001#false} is VALID [2022-04-28 09:18:47,818 INFO L290 TraceCheckUtils]: 95: Hoare triple {35001#false} assume 0 == ~cond; {35001#false} is VALID [2022-04-28 09:18:47,818 INFO L290 TraceCheckUtils]: 96: Hoare triple {35001#false} assume !false; {35001#false} is VALID [2022-04-28 09:18:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:18:47,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:18:47,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212820248] [2022-04-28 09:18:47,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212820248] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:18:47,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355036056] [2022-04-28 09:18:47,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:18:47,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:18:47,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:18:47,820 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 09:18:47,821 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 09:18:47,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:18:47,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:18:47,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 89 conjunts are in the unsatisfiable core [2022-04-28 09:18:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:47,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:18:48,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {35000#true} call ULTIMATE.init(); {35000#true} is VALID [2022-04-28 09:18:48,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {35000#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(14, 2);call #Ultimate.allocInit(12, 3); {35000#true} is VALID [2022-04-28 09:18:48,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {35000#true} assume true; {35000#true} is VALID [2022-04-28 09:18:48,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35000#true} {35000#true} #42#return; {35000#true} is VALID [2022-04-28 09:18:48,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {35000#true} call #t~ret6 := main(); {35000#true} is VALID [2022-04-28 09:18:48,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {35000#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {35005#(= main_~x~0 0)} is VALID [2022-04-28 09:18:48,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {35005#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {35005#(= main_~x~0 0)} is VALID [2022-04-28 09:18:48,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {35005#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35006#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:48,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {35006#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {35006#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:48,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {35006#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:48,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {35007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:48,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {35007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35008#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:48,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {35008#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {35008#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:48,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {35008#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35009#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:48,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {35009#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35009#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:48,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {35009#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:48,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {35010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:48,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {35010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35011#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:48,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {35011#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35011#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:48,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {35011#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35012#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:48,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {35012#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {35012#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:48,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {35012#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35013#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:48,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {35013#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35013#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:48,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {35013#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35014#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:48,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {35014#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35014#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:48,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {35014#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35015#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:48,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {35015#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35015#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:48,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {35015#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35016#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:48,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {35016#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {35016#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:48,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {35016#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35017#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:48,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {35017#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35017#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:48,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {35017#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35018#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:48,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {35018#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35018#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:48,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {35018#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35019#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:48,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {35019#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {35019#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:48,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {35019#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35020#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:48,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {35020#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {35020#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:48,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {35020#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35021#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:48,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {35021#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35021#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:48,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {35021#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35022#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:48,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {35022#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35022#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:48,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {35022#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35023#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:48,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {35023#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35023#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:48,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {35023#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35024#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:48,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {35024#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35024#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:48,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {35024#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35025#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:48,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {35025#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35025#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:48,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {35025#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35026#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:48,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {35026#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35026#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:48,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {35026#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35027#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:48,391 INFO L290 TraceCheckUtils]: 50: Hoare triple {35027#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {35027#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:48,391 INFO L290 TraceCheckUtils]: 51: Hoare triple {35027#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35028#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:48,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {35028#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {35028#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:48,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {35028#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35029#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:48,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {35029#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35029#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:48,392 INFO L290 TraceCheckUtils]: 55: Hoare triple {35029#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35030#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:48,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {35030#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35030#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:48,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {35030#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35031#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:48,393 INFO L290 TraceCheckUtils]: 58: Hoare triple {35031#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35031#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:48,393 INFO L290 TraceCheckUtils]: 59: Hoare triple {35031#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35032#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:48,393 INFO L290 TraceCheckUtils]: 60: Hoare triple {35032#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35032#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:48,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {35032#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35033#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:48,394 INFO L290 TraceCheckUtils]: 62: Hoare triple {35033#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35033#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:48,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {35033#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35034#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:48,395 INFO L290 TraceCheckUtils]: 64: Hoare triple {35034#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {35034#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:48,395 INFO L290 TraceCheckUtils]: 65: Hoare triple {35034#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35035#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:48,395 INFO L290 TraceCheckUtils]: 66: Hoare triple {35035#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35035#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:48,396 INFO L290 TraceCheckUtils]: 67: Hoare triple {35035#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35036#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:48,396 INFO L290 TraceCheckUtils]: 68: Hoare triple {35036#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {35036#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:48,396 INFO L290 TraceCheckUtils]: 69: Hoare triple {35036#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35037#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:48,396 INFO L290 TraceCheckUtils]: 70: Hoare triple {35037#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35037#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:48,397 INFO L290 TraceCheckUtils]: 71: Hoare triple {35037#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35038#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:48,397 INFO L290 TraceCheckUtils]: 72: Hoare triple {35038#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {35038#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:48,397 INFO L290 TraceCheckUtils]: 73: Hoare triple {35038#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35039#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:48,398 INFO L290 TraceCheckUtils]: 74: Hoare triple {35039#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35039#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:48,398 INFO L290 TraceCheckUtils]: 75: Hoare triple {35039#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35040#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:48,398 INFO L290 TraceCheckUtils]: 76: Hoare triple {35040#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {35040#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:48,398 INFO L290 TraceCheckUtils]: 77: Hoare triple {35040#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35041#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:48,399 INFO L290 TraceCheckUtils]: 78: Hoare triple {35041#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {35041#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:48,399 INFO L290 TraceCheckUtils]: 79: Hoare triple {35041#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35042#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:48,399 INFO L290 TraceCheckUtils]: 80: Hoare triple {35042#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {35042#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:48,400 INFO L290 TraceCheckUtils]: 81: Hoare triple {35042#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35043#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:48,400 INFO L290 TraceCheckUtils]: 82: Hoare triple {35043#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {35043#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:48,400 INFO L290 TraceCheckUtils]: 83: Hoare triple {35043#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35044#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:48,400 INFO L290 TraceCheckUtils]: 84: Hoare triple {35044#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {35044#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:48,401 INFO L290 TraceCheckUtils]: 85: Hoare triple {35044#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35045#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:48,401 INFO L290 TraceCheckUtils]: 86: Hoare triple {35045#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {35045#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:48,401 INFO L290 TraceCheckUtils]: 87: Hoare triple {35045#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35046#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:18:48,402 INFO L290 TraceCheckUtils]: 88: Hoare triple {35046#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {35046#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:18:48,402 INFO L290 TraceCheckUtils]: 89: Hoare triple {35046#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35047#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:18:48,402 INFO L290 TraceCheckUtils]: 90: Hoare triple {35047#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 99); {35047#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:18:48,402 INFO L290 TraceCheckUtils]: 91: Hoare triple {35047#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35326#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:18:48,403 INFO L290 TraceCheckUtils]: 92: Hoare triple {35326#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {35001#false} is VALID [2022-04-28 09:18:48,403 INFO L272 TraceCheckUtils]: 93: Hoare triple {35001#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {35001#false} is VALID [2022-04-28 09:18:48,403 INFO L290 TraceCheckUtils]: 94: Hoare triple {35001#false} ~cond := #in~cond; {35001#false} is VALID [2022-04-28 09:18:48,403 INFO L290 TraceCheckUtils]: 95: Hoare triple {35001#false} assume 0 == ~cond; {35001#false} is VALID [2022-04-28 09:18:48,403 INFO L290 TraceCheckUtils]: 96: Hoare triple {35001#false} assume !false; {35001#false} is VALID [2022-04-28 09:18:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:18:48,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:18:50,206 INFO L290 TraceCheckUtils]: 96: Hoare triple {35001#false} assume !false; {35001#false} is VALID [2022-04-28 09:18:50,206 INFO L290 TraceCheckUtils]: 95: Hoare triple {35001#false} assume 0 == ~cond; {35001#false} is VALID [2022-04-28 09:18:50,206 INFO L290 TraceCheckUtils]: 94: Hoare triple {35001#false} ~cond := #in~cond; {35001#false} is VALID [2022-04-28 09:18:50,206 INFO L272 TraceCheckUtils]: 93: Hoare triple {35001#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {35001#false} is VALID [2022-04-28 09:18:50,206 INFO L290 TraceCheckUtils]: 92: Hoare triple {35354#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {35001#false} is VALID [2022-04-28 09:18:50,207 INFO L290 TraceCheckUtils]: 91: Hoare triple {35358#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35354#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:18:50,207 INFO L290 TraceCheckUtils]: 90: Hoare triple {35358#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35358#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:18:50,208 INFO L290 TraceCheckUtils]: 89: Hoare triple {35365#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35358#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:18:50,208 INFO L290 TraceCheckUtils]: 88: Hoare triple {35365#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35365#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:18:50,208 INFO L290 TraceCheckUtils]: 87: Hoare triple {35372#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35365#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:18:50,209 INFO L290 TraceCheckUtils]: 86: Hoare triple {35372#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35372#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:18:50,209 INFO L290 TraceCheckUtils]: 85: Hoare triple {35379#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35372#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:18:50,209 INFO L290 TraceCheckUtils]: 84: Hoare triple {35379#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35379#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:18:50,210 INFO L290 TraceCheckUtils]: 83: Hoare triple {35386#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35379#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:18:50,210 INFO L290 TraceCheckUtils]: 82: Hoare triple {35386#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35386#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:18:50,211 INFO L290 TraceCheckUtils]: 81: Hoare triple {35393#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35386#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:18:50,211 INFO L290 TraceCheckUtils]: 80: Hoare triple {35393#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35393#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:18:50,212 INFO L290 TraceCheckUtils]: 79: Hoare triple {35400#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35393#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:18:50,212 INFO L290 TraceCheckUtils]: 78: Hoare triple {35400#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35400#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:18:50,212 INFO L290 TraceCheckUtils]: 77: Hoare triple {35407#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35400#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:18:50,213 INFO L290 TraceCheckUtils]: 76: Hoare triple {35407#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35407#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:18:50,213 INFO L290 TraceCheckUtils]: 75: Hoare triple {35414#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35407#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:18:50,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {35414#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35414#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:18:50,214 INFO L290 TraceCheckUtils]: 73: Hoare triple {35421#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35414#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:18:50,214 INFO L290 TraceCheckUtils]: 72: Hoare triple {35421#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35421#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:18:50,215 INFO L290 TraceCheckUtils]: 71: Hoare triple {35428#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35421#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:18:50,215 INFO L290 TraceCheckUtils]: 70: Hoare triple {35428#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35428#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:18:50,216 INFO L290 TraceCheckUtils]: 69: Hoare triple {35435#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35428#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:18:50,216 INFO L290 TraceCheckUtils]: 68: Hoare triple {35435#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35435#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:18:50,216 INFO L290 TraceCheckUtils]: 67: Hoare triple {35442#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35435#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:18:50,217 INFO L290 TraceCheckUtils]: 66: Hoare triple {35442#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35442#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:18:50,217 INFO L290 TraceCheckUtils]: 65: Hoare triple {35449#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35442#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:18:50,217 INFO L290 TraceCheckUtils]: 64: Hoare triple {35449#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35449#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-28 09:18:50,218 INFO L290 TraceCheckUtils]: 63: Hoare triple {35456#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35449#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-28 09:18:50,218 INFO L290 TraceCheckUtils]: 62: Hoare triple {35456#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35456#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,219 INFO L290 TraceCheckUtils]: 61: Hoare triple {35463#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35456#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,219 INFO L290 TraceCheckUtils]: 60: Hoare triple {35463#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35463#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,219 INFO L290 TraceCheckUtils]: 59: Hoare triple {35470#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35463#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,220 INFO L290 TraceCheckUtils]: 58: Hoare triple {35470#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35470#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-28 09:18:50,220 INFO L290 TraceCheckUtils]: 57: Hoare triple {35477#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35470#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-28 09:18:50,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {35477#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35477#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-28 09:18:50,221 INFO L290 TraceCheckUtils]: 55: Hoare triple {35484#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35477#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-28 09:18:50,221 INFO L290 TraceCheckUtils]: 54: Hoare triple {35484#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35484#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-28 09:18:50,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {35491#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35484#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-28 09:18:50,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {35491#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35491#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {35498#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35491#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,223 INFO L290 TraceCheckUtils]: 50: Hoare triple {35498#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35498#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,223 INFO L290 TraceCheckUtils]: 49: Hoare triple {35505#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35498#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {35505#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35505#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {35512#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35505#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,224 INFO L290 TraceCheckUtils]: 46: Hoare triple {35512#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35512#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-28 09:18:50,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {35519#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35512#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-28 09:18:50,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {35519#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35519#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-28 09:18:50,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {35526#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35519#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-28 09:18:50,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {35526#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35526#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-28 09:18:50,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {35533#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35526#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-28 09:18:50,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {35533#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35533#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-28 09:18:50,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {35540#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35533#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-28 09:18:50,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {35540#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35540#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-28 09:18:50,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {35547#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35540#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-28 09:18:50,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {35547#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35547#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {35554#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35547#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,229 INFO L290 TraceCheckUtils]: 34: Hoare triple {35554#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35554#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-28 09:18:50,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {35561#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35554#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-28 09:18:50,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {35561#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35561#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-28 09:18:50,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {35568#(< (mod (+ main_~x~0 62) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35561#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-28 09:18:50,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {35568#(< (mod (+ main_~x~0 62) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35568#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-28 09:18:50,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {35575#(< (mod (+ 64 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35568#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-28 09:18:50,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {35575#(< (mod (+ 64 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35575#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {35582#(< (mod (+ 66 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35575#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {35582#(< (mod (+ 66 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35582#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {35589#(< (mod (+ 68 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35582#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {35589#(< (mod (+ 68 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35589#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {35596#(< (mod (+ main_~x~0 70) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35589#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {35596#(< (mod (+ main_~x~0 70) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35596#(< (mod (+ main_~x~0 70) 4294967296) 99)} is VALID [2022-04-28 09:18:50,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {35603#(< (mod (+ 72 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35596#(< (mod (+ main_~x~0 70) 4294967296) 99)} is VALID [2022-04-28 09:18:50,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {35603#(< (mod (+ 72 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35603#(< (mod (+ 72 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {35610#(< (mod (+ main_~x~0 74) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35603#(< (mod (+ 72 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {35610#(< (mod (+ main_~x~0 74) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35610#(< (mod (+ main_~x~0 74) 4294967296) 99)} is VALID [2022-04-28 09:18:50,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {35617#(< (mod (+ 76 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35610#(< (mod (+ main_~x~0 74) 4294967296) 99)} is VALID [2022-04-28 09:18:50,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {35617#(< (mod (+ 76 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35617#(< (mod (+ 76 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {35624#(< (mod (+ main_~x~0 78) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35617#(< (mod (+ 76 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {35624#(< (mod (+ main_~x~0 78) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35624#(< (mod (+ main_~x~0 78) 4294967296) 99)} is VALID [2022-04-28 09:18:50,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {35631#(< (mod (+ main_~x~0 80) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35624#(< (mod (+ main_~x~0 78) 4294967296) 99)} is VALID [2022-04-28 09:18:50,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {35631#(< (mod (+ main_~x~0 80) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35631#(< (mod (+ main_~x~0 80) 4294967296) 99)} is VALID [2022-04-28 09:18:50,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {35638#(< (mod (+ main_~x~0 82) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35631#(< (mod (+ main_~x~0 80) 4294967296) 99)} is VALID [2022-04-28 09:18:50,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {35638#(< (mod (+ main_~x~0 82) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35638#(< (mod (+ main_~x~0 82) 4294967296) 99)} is VALID [2022-04-28 09:18:50,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {35645#(< (mod (+ 84 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35638#(< (mod (+ main_~x~0 82) 4294967296) 99)} is VALID [2022-04-28 09:18:50,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {35645#(< (mod (+ 84 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35645#(< (mod (+ 84 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {35652#(< (mod (+ main_~x~0 86) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {35645#(< (mod (+ 84 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:18:50,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {35652#(< (mod (+ main_~x~0 86) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {35652#(< (mod (+ main_~x~0 86) 4294967296) 99)} is VALID [2022-04-28 09:18:50,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {35000#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {35652#(< (mod (+ main_~x~0 86) 4294967296) 99)} is VALID [2022-04-28 09:18:50,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {35000#true} call #t~ret6 := main(); {35000#true} is VALID [2022-04-28 09:18:50,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35000#true} {35000#true} #42#return; {35000#true} is VALID [2022-04-28 09:18:50,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {35000#true} assume true; {35000#true} is VALID [2022-04-28 09:18:50,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {35000#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(14, 2);call #Ultimate.allocInit(12, 3); {35000#true} is VALID [2022-04-28 09:18:50,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {35000#true} call ULTIMATE.init(); {35000#true} is VALID [2022-04-28 09:18:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:18:50,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355036056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:18:50,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:18:50,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-28 09:18:50,242 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:18:50,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1413538450] [2022-04-28 09:18:50,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1413538450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:18:50,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:18:50,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 09:18:50,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022314588] [2022-04-28 09:18:50,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:18:50,243 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 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 97 [2022-04-28 09:18:50,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:18:50,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:50,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:50,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 09:18:50,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:18:50,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 09:18:50,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1465, Invalid=6907, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 09:18:50,305 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:56,667 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-04-28 09:18:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 09:18:56,683 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 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 97 [2022-04-28 09:18:56,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:18:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 106 transitions. [2022-04-28 09:18:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 106 transitions. [2022-04-28 09:18:56,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 106 transitions. [2022-04-28 09:18:56,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:56,797 INFO L225 Difference]: With dead ends: 106 [2022-04-28 09:18:56,797 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 09:18:56,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2960, Invalid=15400, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 09:18:56,799 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 95 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 3954 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 4043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:18:56,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 223 Invalid, 4043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3954 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 09:18:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 09:18:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2022-04-28 09:18:57,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:18:57,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 100 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:57,240 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 100 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:57,240 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 100 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:57,240 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2022-04-28 09:18:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2022-04-28 09:18:57,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:18:57,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:18:57,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 3 states have call successors, (3), 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 101 states. [2022-04-28 09:18:57,241 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 3 states have call successors, (3), 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 101 states. [2022-04-28 09:18:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:18:57,242 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2022-04-28 09:18:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2022-04-28 09:18:57,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:18:57,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:18:57,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:18:57,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:18:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2022-04-28 09:18:57,243 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2022-04-28 09:18:57,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:18:57,243 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2022-04-28 09:18:57,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:18:57,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 100 transitions. [2022-04-28 09:18:57,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:18:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2022-04-28 09:18:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 09:18:57,410 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:18:57,410 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:18:57,442 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 09:18:57,610 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,SelfDestructingSolverStorable52 [2022-04-28 09:18:57,610 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:18:57,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:18:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1792118756, now seen corresponding path program 87 times [2022-04-28 09:18:57,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:18:57,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [98264296] [2022-04-28 09:18:57,617 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:18:57,617 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:18:57,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1792118756, now seen corresponding path program 88 times [2022-04-28 09:18:57,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:18:57,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501411611] [2022-04-28 09:18:57,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:18:57,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:18:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:58,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:18:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:58,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {36428#(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(14, 2);call #Ultimate.allocInit(12, 3); {36378#true} is VALID [2022-04-28 09:18:58,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {36378#true} assume true; {36378#true} is VALID [2022-04-28 09:18:58,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36378#true} {36378#true} #42#return; {36378#true} is VALID [2022-04-28 09:18:58,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {36378#true} call ULTIMATE.init(); {36428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:18:58,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {36428#(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(14, 2);call #Ultimate.allocInit(12, 3); {36378#true} is VALID [2022-04-28 09:18:58,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {36378#true} assume true; {36378#true} is VALID [2022-04-28 09:18:58,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36378#true} {36378#true} #42#return; {36378#true} is VALID [2022-04-28 09:18:58,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {36378#true} call #t~ret6 := main(); {36378#true} is VALID [2022-04-28 09:18:58,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {36378#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {36383#(= main_~x~0 0)} is VALID [2022-04-28 09:18:58,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {36383#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {36383#(= main_~x~0 0)} is VALID [2022-04-28 09:18:58,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {36383#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:58,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {36384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {36384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:18:58,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {36384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36385#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:58,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {36385#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36385#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:18:58,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {36385#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36386#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:58,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {36386#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {36386#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:18:58,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {36386#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36387#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:58,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {36387#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36387#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:18:58,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {36387#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36388#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:58,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {36388#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36388#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:18:58,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {36388#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36389#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:58,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {36389#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36389#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:18:58,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {36389#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36390#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:58,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {36390#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {36390#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:18:58,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {36390#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36391#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:58,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {36391#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36391#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:18:58,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {36391#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36392#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:58,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {36392#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36392#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:18:58,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {36392#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36393#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:58,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {36393#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36393#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:18:58,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {36393#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36394#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:58,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {36394#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {36394#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:18:58,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {36394#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36395#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:58,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {36395#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36395#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:18:58,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {36395#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36396#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:58,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {36396#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36396#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:18:58,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {36396#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36397#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:58,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {36397#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {36397#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:18:58,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {36397#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36398#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:58,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {36398#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {36398#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:18:58,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {36398#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36399#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:58,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {36399#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36399#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:18:58,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {36399#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36400#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:58,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {36400#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36400#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:18:58,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {36400#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36401#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:58,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {36401#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36401#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:18:58,679 INFO L290 TraceCheckUtils]: 43: Hoare triple {36401#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36402#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:58,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {36402#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36402#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:18:58,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {36402#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36403#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:58,680 INFO L290 TraceCheckUtils]: 46: Hoare triple {36403#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36403#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:18:58,680 INFO L290 TraceCheckUtils]: 47: Hoare triple {36403#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36404#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:58,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {36404#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36404#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:18:58,681 INFO L290 TraceCheckUtils]: 49: Hoare triple {36404#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36405#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:58,681 INFO L290 TraceCheckUtils]: 50: Hoare triple {36405#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {36405#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:18:58,682 INFO L290 TraceCheckUtils]: 51: Hoare triple {36405#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36406#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:58,682 INFO L290 TraceCheckUtils]: 52: Hoare triple {36406#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {36406#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:18:58,682 INFO L290 TraceCheckUtils]: 53: Hoare triple {36406#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36407#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:58,683 INFO L290 TraceCheckUtils]: 54: Hoare triple {36407#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36407#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:18:58,683 INFO L290 TraceCheckUtils]: 55: Hoare triple {36407#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36408#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:58,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {36408#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36408#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:18:58,684 INFO L290 TraceCheckUtils]: 57: Hoare triple {36408#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36409#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:58,684 INFO L290 TraceCheckUtils]: 58: Hoare triple {36409#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36409#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:18:58,684 INFO L290 TraceCheckUtils]: 59: Hoare triple {36409#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36410#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:58,685 INFO L290 TraceCheckUtils]: 60: Hoare triple {36410#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36410#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:18:58,685 INFO L290 TraceCheckUtils]: 61: Hoare triple {36410#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36411#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:58,685 INFO L290 TraceCheckUtils]: 62: Hoare triple {36411#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36411#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:18:58,686 INFO L290 TraceCheckUtils]: 63: Hoare triple {36411#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36412#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:58,686 INFO L290 TraceCheckUtils]: 64: Hoare triple {36412#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {36412#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:18:58,686 INFO L290 TraceCheckUtils]: 65: Hoare triple {36412#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36413#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:58,686 INFO L290 TraceCheckUtils]: 66: Hoare triple {36413#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36413#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:18:58,687 INFO L290 TraceCheckUtils]: 67: Hoare triple {36413#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36414#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:58,687 INFO L290 TraceCheckUtils]: 68: Hoare triple {36414#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {36414#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:18:58,687 INFO L290 TraceCheckUtils]: 69: Hoare triple {36414#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36415#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:58,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {36415#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36415#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:18:58,688 INFO L290 TraceCheckUtils]: 71: Hoare triple {36415#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36416#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:58,688 INFO L290 TraceCheckUtils]: 72: Hoare triple {36416#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {36416#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:18:58,689 INFO L290 TraceCheckUtils]: 73: Hoare triple {36416#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36417#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:58,689 INFO L290 TraceCheckUtils]: 74: Hoare triple {36417#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36417#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:18:58,689 INFO L290 TraceCheckUtils]: 75: Hoare triple {36417#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36418#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:58,690 INFO L290 TraceCheckUtils]: 76: Hoare triple {36418#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36418#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:18:58,690 INFO L290 TraceCheckUtils]: 77: Hoare triple {36418#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36419#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:58,690 INFO L290 TraceCheckUtils]: 78: Hoare triple {36419#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {36419#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:18:58,691 INFO L290 TraceCheckUtils]: 79: Hoare triple {36419#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36420#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:58,691 INFO L290 TraceCheckUtils]: 80: Hoare triple {36420#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {36420#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:18:58,691 INFO L290 TraceCheckUtils]: 81: Hoare triple {36420#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36421#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:58,692 INFO L290 TraceCheckUtils]: 82: Hoare triple {36421#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {36421#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:18:58,692 INFO L290 TraceCheckUtils]: 83: Hoare triple {36421#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36422#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:58,692 INFO L290 TraceCheckUtils]: 84: Hoare triple {36422#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {36422#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:18:58,693 INFO L290 TraceCheckUtils]: 85: Hoare triple {36422#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36423#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:58,693 INFO L290 TraceCheckUtils]: 86: Hoare triple {36423#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {36423#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:18:58,693 INFO L290 TraceCheckUtils]: 87: Hoare triple {36423#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36424#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:18:58,693 INFO L290 TraceCheckUtils]: 88: Hoare triple {36424#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {36424#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:18:58,694 INFO L290 TraceCheckUtils]: 89: Hoare triple {36424#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36425#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:18:58,694 INFO L290 TraceCheckUtils]: 90: Hoare triple {36425#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 99); {36425#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:18:58,694 INFO L290 TraceCheckUtils]: 91: Hoare triple {36425#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36426#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:18:58,695 INFO L290 TraceCheckUtils]: 92: Hoare triple {36426#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36426#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:18:58,695 INFO L290 TraceCheckUtils]: 93: Hoare triple {36426#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36427#(and (<= main_~x~0 88) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:18:58,695 INFO L290 TraceCheckUtils]: 94: Hoare triple {36427#(and (<= main_~x~0 88) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {36379#false} is VALID [2022-04-28 09:18:58,696 INFO L272 TraceCheckUtils]: 95: Hoare triple {36379#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {36379#false} is VALID [2022-04-28 09:18:58,696 INFO L290 TraceCheckUtils]: 96: Hoare triple {36379#false} ~cond := #in~cond; {36379#false} is VALID [2022-04-28 09:18:58,696 INFO L290 TraceCheckUtils]: 97: Hoare triple {36379#false} assume 0 == ~cond; {36379#false} is VALID [2022-04-28 09:18:58,696 INFO L290 TraceCheckUtils]: 98: Hoare triple {36379#false} assume !false; {36379#false} is VALID [2022-04-28 09:18:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:18:58,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:18:58,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501411611] [2022-04-28 09:18:58,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501411611] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:18:58,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082485339] [2022-04-28 09:18:58,697 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:18:58,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:18:58,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:18:58,698 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 09:18:58,698 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 09:18:58,738 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:18:58,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:18:58,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 94 conjunts are in the unsatisfiable core [2022-04-28 09:18:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:18:58,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:19:00,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {36378#true} call ULTIMATE.init(); {36378#true} is VALID [2022-04-28 09:19:00,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {36378#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(14, 2);call #Ultimate.allocInit(12, 3); {36378#true} is VALID [2022-04-28 09:19:00,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {36378#true} assume true; {36378#true} is VALID [2022-04-28 09:19:00,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36378#true} {36378#true} #42#return; {36378#true} is VALID [2022-04-28 09:19:00,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {36378#true} call #t~ret6 := main(); {36378#true} is VALID [2022-04-28 09:19:00,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {36378#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {36383#(= main_~x~0 0)} is VALID [2022-04-28 09:19:00,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {36383#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {36383#(= main_~x~0 0)} is VALID [2022-04-28 09:19:00,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {36383#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36453#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:19:00,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {36453#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {36453#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-28 09:19:00,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {36453#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36460#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:19:00,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {36460#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {36460#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:19:00,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {36460#(and (<= (mod main_~y~0 2) 0) (= 2 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36467#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:19:00,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {36467#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {36467#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:19:00,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {36467#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36474#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {36474#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36474#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {36474#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36481#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {36481#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36481#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {36481#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36488#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {36488#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36488#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {36488#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36495#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {36495#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36495#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {36495#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36502#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} is VALID [2022-04-28 09:19:00,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {36502#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} assume !!(~x~0 % 4294967296 < 99); {36502#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} is VALID [2022-04-28 09:19:00,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {36502#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36509#(and (<= (mod main_~y~0 2) 0) (= 12 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:19:00,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {36509#(and (<= (mod main_~y~0 2) 0) (= 12 (+ main_~x~0 (- 6))))} assume !!(~x~0 % 4294967296 < 99); {36509#(and (<= (mod main_~y~0 2) 0) (= 12 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:19:00,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {36509#(and (<= (mod main_~y~0 2) 0) (= 12 (+ main_~x~0 (- 6))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36516#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {36516#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36516#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {36516#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36523#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {36523#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36523#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {36523#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36530#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {36530#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36530#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {36530#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36537#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:19:00,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {36537#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 99); {36537#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:19:00,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {36537#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36544#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {36544#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36544#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {36544#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36551#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:19:00,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {36551#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36551#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:19:00,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {36551#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36558#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:19:00,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {36558#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {36558#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:19:00,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {36558#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36565#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:19:00,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {36565#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {36565#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-28 09:19:00,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {36565#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36572#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:19:00,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {36572#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume !!(~x~0 % 4294967296 < 99); {36572#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:19:00,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {36572#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36579#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {36579#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36579#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {36579#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36586#(and (= (+ main_~x~0 (- 4)) 36) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {36586#(and (= (+ main_~x~0 (- 4)) 36) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36586#(and (= (+ main_~x~0 (- 4)) 36) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,990 INFO L290 TraceCheckUtils]: 47: Hoare triple {36586#(and (= (+ main_~x~0 (- 4)) 36) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36593#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:19:00,990 INFO L290 TraceCheckUtils]: 48: Hoare triple {36593#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36593#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:19:00,991 INFO L290 TraceCheckUtils]: 49: Hoare triple {36593#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36600#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:19:00,991 INFO L290 TraceCheckUtils]: 50: Hoare triple {36600#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {36600#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:19:00,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {36600#(and (<= (mod main_~y~0 2) 0) (= 42 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36607#(and (= 42 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,992 INFO L290 TraceCheckUtils]: 52: Hoare triple {36607#(and (= 42 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36607#(and (= 42 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,992 INFO L290 TraceCheckUtils]: 53: Hoare triple {36607#(and (= 42 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36614#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} is VALID [2022-04-28 09:19:00,993 INFO L290 TraceCheckUtils]: 54: Hoare triple {36614#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} assume !!(~x~0 % 4294967296 < 99); {36614#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} is VALID [2022-04-28 09:19:00,993 INFO L290 TraceCheckUtils]: 55: Hoare triple {36614#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36621#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,993 INFO L290 TraceCheckUtils]: 56: Hoare triple {36621#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36621#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {36621#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36628#(and (= (+ (- 2) main_~x~0) 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {36628#(and (= (+ (- 2) main_~x~0) 50) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36628#(and (= (+ (- 2) main_~x~0) 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,994 INFO L290 TraceCheckUtils]: 59: Hoare triple {36628#(and (= (+ (- 2) main_~x~0) 50) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36635#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,995 INFO L290 TraceCheckUtils]: 60: Hoare triple {36635#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36635#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,995 INFO L290 TraceCheckUtils]: 61: Hoare triple {36635#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36642#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,995 INFO L290 TraceCheckUtils]: 62: Hoare triple {36642#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36642#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,996 INFO L290 TraceCheckUtils]: 63: Hoare triple {36642#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36649#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,996 INFO L290 TraceCheckUtils]: 64: Hoare triple {36649#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36649#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,997 INFO L290 TraceCheckUtils]: 65: Hoare triple {36649#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36656#(and (= main_~x~0 60) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,997 INFO L290 TraceCheckUtils]: 66: Hoare triple {36656#(and (= main_~x~0 60) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36656#(and (= main_~x~0 60) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,997 INFO L290 TraceCheckUtils]: 67: Hoare triple {36656#(and (= main_~x~0 60) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36663#(and (= 60 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,998 INFO L290 TraceCheckUtils]: 68: Hoare triple {36663#(and (= 60 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36663#(and (= 60 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,998 INFO L290 TraceCheckUtils]: 69: Hoare triple {36663#(and (= 60 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36670#(and (= 60 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,998 INFO L290 TraceCheckUtils]: 70: Hoare triple {36670#(and (= 60 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36670#(and (= 60 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,999 INFO L290 TraceCheckUtils]: 71: Hoare triple {36670#(and (= 60 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36677#(and (= 60 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:00,999 INFO L290 TraceCheckUtils]: 72: Hoare triple {36677#(and (= 60 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36677#(and (= 60 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,000 INFO L290 TraceCheckUtils]: 73: Hoare triple {36677#(and (= 60 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36684#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 60))} is VALID [2022-04-28 09:19:01,000 INFO L290 TraceCheckUtils]: 74: Hoare triple {36684#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 60))} assume !!(~x~0 % 4294967296 < 99); {36684#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 60))} is VALID [2022-04-28 09:19:01,000 INFO L290 TraceCheckUtils]: 75: Hoare triple {36684#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 8)) 60))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36691#(and (= main_~x~0 70) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,001 INFO L290 TraceCheckUtils]: 76: Hoare triple {36691#(and (= main_~x~0 70) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36691#(and (= main_~x~0 70) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,001 INFO L290 TraceCheckUtils]: 77: Hoare triple {36691#(and (= main_~x~0 70) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36698#(and (= 70 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,002 INFO L290 TraceCheckUtils]: 78: Hoare triple {36698#(and (= 70 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36698#(and (= 70 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,002 INFO L290 TraceCheckUtils]: 79: Hoare triple {36698#(and (= 70 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36705#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 70))} is VALID [2022-04-28 09:19:01,002 INFO L290 TraceCheckUtils]: 80: Hoare triple {36705#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 70))} assume !!(~x~0 % 4294967296 < 99); {36705#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 70))} is VALID [2022-04-28 09:19:01,003 INFO L290 TraceCheckUtils]: 81: Hoare triple {36705#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 70))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36712#(and (<= (mod main_~y~0 2) 0) (= 76 main_~x~0))} is VALID [2022-04-28 09:19:01,003 INFO L290 TraceCheckUtils]: 82: Hoare triple {36712#(and (<= (mod main_~y~0 2) 0) (= 76 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {36712#(and (<= (mod main_~y~0 2) 0) (= 76 main_~x~0))} is VALID [2022-04-28 09:19:01,003 INFO L290 TraceCheckUtils]: 83: Hoare triple {36712#(and (<= (mod main_~y~0 2) 0) (= 76 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36719#(and (= main_~x~0 78) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,004 INFO L290 TraceCheckUtils]: 84: Hoare triple {36719#(and (= main_~x~0 78) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36719#(and (= main_~x~0 78) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,004 INFO L290 TraceCheckUtils]: 85: Hoare triple {36719#(and (= main_~x~0 78) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36726#(and (= 78 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,005 INFO L290 TraceCheckUtils]: 86: Hoare triple {36726#(and (= 78 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36726#(and (= 78 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,005 INFO L290 TraceCheckUtils]: 87: Hoare triple {36726#(and (= 78 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36733#(and (= main_~x~0 82) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,005 INFO L290 TraceCheckUtils]: 88: Hoare triple {36733#(and (= main_~x~0 82) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36733#(and (= main_~x~0 82) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,006 INFO L290 TraceCheckUtils]: 89: Hoare triple {36733#(and (= main_~x~0 82) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36740#(and (= 82 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,006 INFO L290 TraceCheckUtils]: 90: Hoare triple {36740#(and (= 82 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {36740#(and (= 82 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,006 INFO L290 TraceCheckUtils]: 91: Hoare triple {36740#(and (= 82 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36747#(and (<= (mod main_~y~0 2) 0) (= 82 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:19:01,007 INFO L290 TraceCheckUtils]: 92: Hoare triple {36747#(and (<= (mod main_~y~0 2) 0) (= 82 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < 99); {36747#(and (<= (mod main_~y~0 2) 0) (= 82 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:19:01,007 INFO L290 TraceCheckUtils]: 93: Hoare triple {36747#(and (<= (mod main_~y~0 2) 0) (= 82 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36754#(and (= 88 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,007 INFO L290 TraceCheckUtils]: 94: Hoare triple {36754#(and (= 88 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {36754#(and (= 88 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:01,008 INFO L272 TraceCheckUtils]: 95: Hoare triple {36754#(and (= 88 main_~x~0) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {36761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:19:01,008 INFO L290 TraceCheckUtils]: 96: Hoare triple {36761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:19:01,009 INFO L290 TraceCheckUtils]: 97: Hoare triple {36765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36379#false} is VALID [2022-04-28 09:19:01,009 INFO L290 TraceCheckUtils]: 98: Hoare triple {36379#false} assume !false; {36379#false} is VALID [2022-04-28 09:19:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:01,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:19:01,623 INFO L290 TraceCheckUtils]: 98: Hoare triple {36379#false} assume !false; {36379#false} is VALID [2022-04-28 09:19:01,624 INFO L290 TraceCheckUtils]: 97: Hoare triple {36765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36379#false} is VALID [2022-04-28 09:19:01,624 INFO L290 TraceCheckUtils]: 96: Hoare triple {36761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:19:01,624 INFO L272 TraceCheckUtils]: 95: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {36761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:19:01,625 INFO L290 TraceCheckUtils]: 94: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,625 INFO L290 TraceCheckUtils]: 93: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,626 INFO L290 TraceCheckUtils]: 92: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,626 INFO L290 TraceCheckUtils]: 91: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,626 INFO L290 TraceCheckUtils]: 90: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,627 INFO L290 TraceCheckUtils]: 89: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,627 INFO L290 TraceCheckUtils]: 88: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,628 INFO L290 TraceCheckUtils]: 87: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,628 INFO L290 TraceCheckUtils]: 86: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,628 INFO L290 TraceCheckUtils]: 85: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,629 INFO L290 TraceCheckUtils]: 84: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,629 INFO L290 TraceCheckUtils]: 83: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,630 INFO L290 TraceCheckUtils]: 82: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,630 INFO L290 TraceCheckUtils]: 81: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,630 INFO L290 TraceCheckUtils]: 80: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,631 INFO L290 TraceCheckUtils]: 79: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,631 INFO L290 TraceCheckUtils]: 78: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,632 INFO L290 TraceCheckUtils]: 77: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,632 INFO L290 TraceCheckUtils]: 76: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,632 INFO L290 TraceCheckUtils]: 75: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,633 INFO L290 TraceCheckUtils]: 74: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,633 INFO L290 TraceCheckUtils]: 73: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,633 INFO L290 TraceCheckUtils]: 72: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,634 INFO L290 TraceCheckUtils]: 71: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,634 INFO L290 TraceCheckUtils]: 70: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,635 INFO L290 TraceCheckUtils]: 69: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,635 INFO L290 TraceCheckUtils]: 68: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,635 INFO L290 TraceCheckUtils]: 67: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,636 INFO L290 TraceCheckUtils]: 65: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,637 INFO L290 TraceCheckUtils]: 64: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,637 INFO L290 TraceCheckUtils]: 63: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,638 INFO L290 TraceCheckUtils]: 60: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,639 INFO L290 TraceCheckUtils]: 59: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,639 INFO L290 TraceCheckUtils]: 58: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,640 INFO L290 TraceCheckUtils]: 56: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,640 INFO L290 TraceCheckUtils]: 55: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,640 INFO L290 TraceCheckUtils]: 54: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,642 INFO L290 TraceCheckUtils]: 51: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,642 INFO L290 TraceCheckUtils]: 50: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,643 INFO L290 TraceCheckUtils]: 49: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,643 INFO L290 TraceCheckUtils]: 48: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,643 INFO L290 TraceCheckUtils]: 47: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,644 INFO L290 TraceCheckUtils]: 46: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,644 INFO L290 TraceCheckUtils]: 45: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,644 INFO L290 TraceCheckUtils]: 44: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,645 INFO L290 TraceCheckUtils]: 42: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,646 INFO L290 TraceCheckUtils]: 39: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {37046#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {36781#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:01,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {37046#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {37046#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:19:01,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {36378#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {37046#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:19:01,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {36378#true} call #t~ret6 := main(); {36378#true} is VALID [2022-04-28 09:19:01,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36378#true} {36378#true} #42#return; {36378#true} is VALID [2022-04-28 09:19:01,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {36378#true} assume true; {36378#true} is VALID [2022-04-28 09:19:01,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {36378#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(14, 2);call #Ultimate.allocInit(12, 3); {36378#true} is VALID [2022-04-28 09:19:01,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {36378#true} call ULTIMATE.init(); {36378#true} is VALID [2022-04-28 09:19:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2022-04-28 09:19:01,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082485339] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:19:01,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:19:01,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 49, 6] total 96 [2022-04-28 09:19:01,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:19:01,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [98264296] [2022-04-28 09:19:01,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [98264296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:19:01,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:19:01,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 09:19:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821499081] [2022-04-28 09:19:01,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:19:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 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 99 [2022-04-28 09:19:01,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:19:01,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:01,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:01,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 09:19:01,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:01,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 09:19:01,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=8668, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 09:19:01,708 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:06,767 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-04-28 09:19:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 09:19:06,767 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 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 99 [2022-04-28 09:19:06,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:19:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 108 transitions. [2022-04-28 09:19:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 108 transitions. [2022-04-28 09:19:06,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 108 transitions. [2022-04-28 09:19:06,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:06,823 INFO L225 Difference]: With dead ends: 108 [2022-04-28 09:19:06,823 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 09:19:06,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4183 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=764, Invalid=18976, Unknown=0, NotChecked=0, Total=19740 [2022-04-28 09:19:06,825 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 97 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 4124 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 4215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 4124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:19:06,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 218 Invalid, 4215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 4124 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 09:19:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 09:19:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2022-04-28 09:19:07,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:19:07,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 102 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:07,156 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 102 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:07,156 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 102 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:07,157 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2022-04-28 09:19:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2022-04-28 09:19:07,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:19:07,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:19:07,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 3 states have call successors, (3), 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 103 states. [2022-04-28 09:19:07,157 INFO L87 Difference]: Start difference. First operand has 102 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 3 states have call successors, (3), 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 103 states. [2022-04-28 09:19:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:07,158 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2022-04-28 09:19:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2022-04-28 09:19:07,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:19:07,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:19:07,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:19:07,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:19:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2022-04-28 09:19:07,159 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2022-04-28 09:19:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:19:07,159 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2022-04-28 09:19:07,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:07,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 102 transitions. [2022-04-28 09:19:07,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-04-28 09:19:07,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 09:19:07,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:19:07,299 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:19:07,317 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 09:19:07,514 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,SelfDestructingSolverStorable53 [2022-04-28 09:19:07,515 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:19:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:19:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash 986205025, now seen corresponding path program 89 times [2022-04-28 09:19:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:07,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2056683767] [2022-04-28 09:19:07,518 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:19:07,518 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:19:07,518 INFO L85 PathProgramCache]: Analyzing trace with hash 986205025, now seen corresponding path program 90 times [2022-04-28 09:19:07,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:19:07,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377297026] [2022-04-28 09:19:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:19:07,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:19:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:08,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:19:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:08,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {37837#(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(14, 2);call #Ultimate.allocInit(12, 3); {37786#true} is VALID [2022-04-28 09:19:08,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {37786#true} assume true; {37786#true} is VALID [2022-04-28 09:19:08,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37786#true} {37786#true} #42#return; {37786#true} is VALID [2022-04-28 09:19:08,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {37786#true} call ULTIMATE.init(); {37837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:19:08,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {37837#(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(14, 2);call #Ultimate.allocInit(12, 3); {37786#true} is VALID [2022-04-28 09:19:08,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {37786#true} assume true; {37786#true} is VALID [2022-04-28 09:19:08,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37786#true} {37786#true} #42#return; {37786#true} is VALID [2022-04-28 09:19:08,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {37786#true} call #t~ret6 := main(); {37786#true} is VALID [2022-04-28 09:19:08,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {37786#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {37791#(= main_~x~0 0)} is VALID [2022-04-28 09:19:08,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {37791#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {37791#(= main_~x~0 0)} is VALID [2022-04-28 09:19:08,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {37791#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37792#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:08,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {37792#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {37792#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:08,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {37792#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37793#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:08,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {37793#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37793#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:08,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {37793#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37794#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:08,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {37794#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {37794#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:08,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {37794#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37795#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:08,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {37795#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37795#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:08,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {37795#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:08,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {37796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:08,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {37796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37797#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:08,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {37797#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37797#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:08,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {37797#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37798#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:08,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {37798#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {37798#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:08,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {37798#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37799#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:08,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {37799#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37799#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:08,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {37799#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37800#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:08,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {37800#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37800#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:08,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {37800#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37801#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:08,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {37801#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37801#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:08,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {37801#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37802#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:08,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {37802#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {37802#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:08,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {37802#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37803#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:08,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {37803#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37803#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:08,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {37803#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37804#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:08,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {37804#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37804#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:08,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {37804#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37805#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:08,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {37805#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {37805#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:08,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {37805#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37806#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:08,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {37806#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {37806#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:08,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {37806#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37807#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:08,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {37807#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37807#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:08,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {37807#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37808#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:08,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {37808#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37808#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:08,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {37808#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37809#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:08,354 INFO L290 TraceCheckUtils]: 42: Hoare triple {37809#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37809#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:08,354 INFO L290 TraceCheckUtils]: 43: Hoare triple {37809#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37810#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:08,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {37810#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37810#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:08,355 INFO L290 TraceCheckUtils]: 45: Hoare triple {37810#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37811#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:08,355 INFO L290 TraceCheckUtils]: 46: Hoare triple {37811#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37811#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:08,355 INFO L290 TraceCheckUtils]: 47: Hoare triple {37811#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37812#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:08,355 INFO L290 TraceCheckUtils]: 48: Hoare triple {37812#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37812#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:08,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {37812#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37813#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:08,356 INFO L290 TraceCheckUtils]: 50: Hoare triple {37813#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {37813#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:08,356 INFO L290 TraceCheckUtils]: 51: Hoare triple {37813#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37814#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:08,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {37814#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {37814#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:08,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {37814#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37815#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:08,357 INFO L290 TraceCheckUtils]: 54: Hoare triple {37815#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37815#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:08,357 INFO L290 TraceCheckUtils]: 55: Hoare triple {37815#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37816#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:19:08,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {37816#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37816#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:19:08,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {37816#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37817#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:19:08,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {37817#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37817#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:19:08,359 INFO L290 TraceCheckUtils]: 59: Hoare triple {37817#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37818#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:08,359 INFO L290 TraceCheckUtils]: 60: Hoare triple {37818#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37818#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:08,359 INFO L290 TraceCheckUtils]: 61: Hoare triple {37818#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37819#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:08,359 INFO L290 TraceCheckUtils]: 62: Hoare triple {37819#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37819#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:08,360 INFO L290 TraceCheckUtils]: 63: Hoare triple {37819#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37820#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:08,360 INFO L290 TraceCheckUtils]: 64: Hoare triple {37820#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {37820#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:08,360 INFO L290 TraceCheckUtils]: 65: Hoare triple {37820#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37821#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:19:08,361 INFO L290 TraceCheckUtils]: 66: Hoare triple {37821#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37821#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:19:08,361 INFO L290 TraceCheckUtils]: 67: Hoare triple {37821#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37822#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:08,361 INFO L290 TraceCheckUtils]: 68: Hoare triple {37822#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {37822#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:08,362 INFO L290 TraceCheckUtils]: 69: Hoare triple {37822#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37823#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:19:08,362 INFO L290 TraceCheckUtils]: 70: Hoare triple {37823#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37823#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:19:08,362 INFO L290 TraceCheckUtils]: 71: Hoare triple {37823#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37824#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:08,362 INFO L290 TraceCheckUtils]: 72: Hoare triple {37824#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {37824#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:08,363 INFO L290 TraceCheckUtils]: 73: Hoare triple {37824#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37825#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:19:08,363 INFO L290 TraceCheckUtils]: 74: Hoare triple {37825#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37825#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:19:08,363 INFO L290 TraceCheckUtils]: 75: Hoare triple {37825#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37826#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:08,364 INFO L290 TraceCheckUtils]: 76: Hoare triple {37826#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37826#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:08,364 INFO L290 TraceCheckUtils]: 77: Hoare triple {37826#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37827#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:08,364 INFO L290 TraceCheckUtils]: 78: Hoare triple {37827#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {37827#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:08,364 INFO L290 TraceCheckUtils]: 79: Hoare triple {37827#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37828#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:08,365 INFO L290 TraceCheckUtils]: 80: Hoare triple {37828#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {37828#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:08,365 INFO L290 TraceCheckUtils]: 81: Hoare triple {37828#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37829#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:19:08,365 INFO L290 TraceCheckUtils]: 82: Hoare triple {37829#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {37829#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:19:08,366 INFO L290 TraceCheckUtils]: 83: Hoare triple {37829#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37830#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:08,366 INFO L290 TraceCheckUtils]: 84: Hoare triple {37830#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {37830#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:08,366 INFO L290 TraceCheckUtils]: 85: Hoare triple {37830#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37831#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:08,366 INFO L290 TraceCheckUtils]: 86: Hoare triple {37831#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {37831#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:08,367 INFO L290 TraceCheckUtils]: 87: Hoare triple {37831#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37832#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:19:08,367 INFO L290 TraceCheckUtils]: 88: Hoare triple {37832#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {37832#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:19:08,367 INFO L290 TraceCheckUtils]: 89: Hoare triple {37832#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37833#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:19:08,368 INFO L290 TraceCheckUtils]: 90: Hoare triple {37833#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 99); {37833#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:19:08,368 INFO L290 TraceCheckUtils]: 91: Hoare triple {37833#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37834#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:19:08,368 INFO L290 TraceCheckUtils]: 92: Hoare triple {37834#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37834#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:19:08,368 INFO L290 TraceCheckUtils]: 93: Hoare triple {37834#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37835#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:08,369 INFO L290 TraceCheckUtils]: 94: Hoare triple {37835#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37835#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:08,369 INFO L290 TraceCheckUtils]: 95: Hoare triple {37835#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37836#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 90))} is VALID [2022-04-28 09:19:08,369 INFO L290 TraceCheckUtils]: 96: Hoare triple {37836#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 90))} assume !(~x~0 % 4294967296 < 99); {37787#false} is VALID [2022-04-28 09:19:08,369 INFO L272 TraceCheckUtils]: 97: Hoare triple {37787#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {37787#false} is VALID [2022-04-28 09:19:08,370 INFO L290 TraceCheckUtils]: 98: Hoare triple {37787#false} ~cond := #in~cond; {37787#false} is VALID [2022-04-28 09:19:08,370 INFO L290 TraceCheckUtils]: 99: Hoare triple {37787#false} assume 0 == ~cond; {37787#false} is VALID [2022-04-28 09:19:08,370 INFO L290 TraceCheckUtils]: 100: Hoare triple {37787#false} assume !false; {37787#false} is VALID [2022-04-28 09:19:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:08,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:19:08,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377297026] [2022-04-28 09:19:08,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377297026] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:19:08,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394340846] [2022-04-28 09:19:08,370 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:19:08,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:19:08,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:19:08,372 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 09:19:08,372 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 09:19:12,417 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2022-04-28 09:19:12,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:19:12,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-28 09:19:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:12,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:19:13,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {37786#true} call ULTIMATE.init(); {37786#true} is VALID [2022-04-28 09:19:13,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {37786#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(14, 2);call #Ultimate.allocInit(12, 3); {37786#true} is VALID [2022-04-28 09:19:13,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {37786#true} assume true; {37786#true} is VALID [2022-04-28 09:19:13,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37786#true} {37786#true} #42#return; {37786#true} is VALID [2022-04-28 09:19:13,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {37786#true} call #t~ret6 := main(); {37786#true} is VALID [2022-04-28 09:19:13,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {37786#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {37791#(= main_~x~0 0)} is VALID [2022-04-28 09:19:13,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {37791#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {37791#(= main_~x~0 0)} is VALID [2022-04-28 09:19:13,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {37791#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37792#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:13,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {37792#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {37792#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:13,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {37792#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37793#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:13,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {37793#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37793#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:13,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {37793#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37794#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:13,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {37794#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {37794#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:13,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {37794#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37795#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:13,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {37795#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37795#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:13,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {37795#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:13,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {37796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:13,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {37796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37797#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:13,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {37797#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37797#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:13,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {37797#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37798#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:13,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {37798#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {37798#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:13,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {37798#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37799#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:13,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {37799#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37799#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:13,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {37799#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37800#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:13,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {37800#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37800#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:13,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {37800#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37801#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:13,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {37801#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37801#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:13,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {37801#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37802#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:13,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {37802#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {37802#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:13,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {37802#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37803#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:13,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {37803#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37803#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:13,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {37803#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37804#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:13,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {37804#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37804#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:13,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {37804#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37805#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:13,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {37805#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {37805#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:13,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {37805#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37806#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:13,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {37806#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {37806#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:13,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {37806#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37807#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:13,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {37807#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37807#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:13,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {37807#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37808#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:13,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {37808#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37808#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:13,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {37808#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37809#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:13,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {37809#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37809#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:13,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {37809#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37810#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:13,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {37810#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37810#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:13,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {37810#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37811#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:13,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {37811#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37811#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:13,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {37811#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37812#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:13,662 INFO L290 TraceCheckUtils]: 48: Hoare triple {37812#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {37812#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:13,662 INFO L290 TraceCheckUtils]: 49: Hoare triple {37812#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37813#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:13,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {37813#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {37813#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:13,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {37813#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {37994#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:13,663 INFO L290 TraceCheckUtils]: 52: Hoare triple {37994#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {37994#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:13,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {37994#(and (<= 46 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38001#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:13,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {38001#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {38001#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:13,664 INFO L290 TraceCheckUtils]: 55: Hoare triple {38001#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38008#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {38008#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38008#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {38008#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38015#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {38015#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38015#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,666 INFO L290 TraceCheckUtils]: 59: Hoare triple {38015#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38022#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:13,666 INFO L290 TraceCheckUtils]: 60: Hoare triple {38022#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {38022#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:13,666 INFO L290 TraceCheckUtils]: 61: Hoare triple {38022#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38029#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:13,667 INFO L290 TraceCheckUtils]: 62: Hoare triple {38029#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {38029#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:13,667 INFO L290 TraceCheckUtils]: 63: Hoare triple {38029#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38036#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:13,667 INFO L290 TraceCheckUtils]: 64: Hoare triple {38036#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {38036#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:13,667 INFO L290 TraceCheckUtils]: 65: Hoare triple {38036#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38043#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,668 INFO L290 TraceCheckUtils]: 66: Hoare triple {38043#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38043#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,668 INFO L290 TraceCheckUtils]: 67: Hoare triple {38043#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38050#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:13,668 INFO L290 TraceCheckUtils]: 68: Hoare triple {38050#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {38050#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:13,669 INFO L290 TraceCheckUtils]: 69: Hoare triple {38050#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38057#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,669 INFO L290 TraceCheckUtils]: 70: Hoare triple {38057#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38057#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,669 INFO L290 TraceCheckUtils]: 71: Hoare triple {38057#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38064#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:13,670 INFO L290 TraceCheckUtils]: 72: Hoare triple {38064#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {38064#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:13,670 INFO L290 TraceCheckUtils]: 73: Hoare triple {38064#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38071#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,670 INFO L290 TraceCheckUtils]: 74: Hoare triple {38071#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38071#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,671 INFO L290 TraceCheckUtils]: 75: Hoare triple {38071#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38078#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:13,671 INFO L290 TraceCheckUtils]: 76: Hoare triple {38078#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {38078#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:13,671 INFO L290 TraceCheckUtils]: 77: Hoare triple {38078#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38085#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:13,672 INFO L290 TraceCheckUtils]: 78: Hoare triple {38085#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {38085#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:13,672 INFO L290 TraceCheckUtils]: 79: Hoare triple {38085#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38092#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:13,672 INFO L290 TraceCheckUtils]: 80: Hoare triple {38092#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {38092#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:13,673 INFO L290 TraceCheckUtils]: 81: Hoare triple {38092#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38099#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,673 INFO L290 TraceCheckUtils]: 82: Hoare triple {38099#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38099#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,673 INFO L290 TraceCheckUtils]: 83: Hoare triple {38099#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38106#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:13,673 INFO L290 TraceCheckUtils]: 84: Hoare triple {38106#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {38106#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:13,674 INFO L290 TraceCheckUtils]: 85: Hoare triple {38106#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38113#(and (<= 80 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:13,674 INFO L290 TraceCheckUtils]: 86: Hoare triple {38113#(and (<= 80 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {38113#(and (<= 80 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:13,674 INFO L290 TraceCheckUtils]: 87: Hoare triple {38113#(and (<= 80 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38120#(and (<= 82 main_~x~0) (<= main_~x~0 82) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,675 INFO L290 TraceCheckUtils]: 88: Hoare triple {38120#(and (<= 82 main_~x~0) (<= main_~x~0 82) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38120#(and (<= 82 main_~x~0) (<= main_~x~0 82) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,675 INFO L290 TraceCheckUtils]: 89: Hoare triple {38120#(and (<= 82 main_~x~0) (<= main_~x~0 82) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38127#(and (<= 84 main_~x~0) (<= main_~x~0 84) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,675 INFO L290 TraceCheckUtils]: 90: Hoare triple {38127#(and (<= 84 main_~x~0) (<= main_~x~0 84) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38127#(and (<= 84 main_~x~0) (<= main_~x~0 84) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,676 INFO L290 TraceCheckUtils]: 91: Hoare triple {38127#(and (<= 84 main_~x~0) (<= main_~x~0 84) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38134#(and (<= main_~x~0 86) (<= 86 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,676 INFO L290 TraceCheckUtils]: 92: Hoare triple {38134#(and (<= main_~x~0 86) (<= 86 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38134#(and (<= main_~x~0 86) (<= 86 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:13,676 INFO L290 TraceCheckUtils]: 93: Hoare triple {38134#(and (<= main_~x~0 86) (<= 86 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38141#(and (<= main_~x~0 88) (<= (mod main_~y~0 2) 0) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:13,677 INFO L290 TraceCheckUtils]: 94: Hoare triple {38141#(and (<= main_~x~0 88) (<= (mod main_~y~0 2) 0) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {38141#(and (<= main_~x~0 88) (<= (mod main_~y~0 2) 0) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:13,677 INFO L290 TraceCheckUtils]: 95: Hoare triple {38141#(and (<= main_~x~0 88) (<= (mod main_~y~0 2) 0) (<= 88 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38148#(and (<= 90 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 90))} is VALID [2022-04-28 09:19:13,677 INFO L290 TraceCheckUtils]: 96: Hoare triple {38148#(and (<= 90 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 90))} assume !(~x~0 % 4294967296 < 99); {37787#false} is VALID [2022-04-28 09:19:13,677 INFO L272 TraceCheckUtils]: 97: Hoare triple {37787#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {37787#false} is VALID [2022-04-28 09:19:13,677 INFO L290 TraceCheckUtils]: 98: Hoare triple {37787#false} ~cond := #in~cond; {37787#false} is VALID [2022-04-28 09:19:13,677 INFO L290 TraceCheckUtils]: 99: Hoare triple {37787#false} assume 0 == ~cond; {37787#false} is VALID [2022-04-28 09:19:13,678 INFO L290 TraceCheckUtils]: 100: Hoare triple {37787#false} assume !false; {37787#false} is VALID [2022-04-28 09:19:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:13,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:19:17,355 INFO L290 TraceCheckUtils]: 100: Hoare triple {37787#false} assume !false; {37787#false} is VALID [2022-04-28 09:19:17,355 INFO L290 TraceCheckUtils]: 99: Hoare triple {38167#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37787#false} is VALID [2022-04-28 09:19:17,355 INFO L290 TraceCheckUtils]: 98: Hoare triple {38171#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38167#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:19:17,356 INFO L272 TraceCheckUtils]: 97: Hoare triple {38175#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {38171#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:19:17,356 INFO L290 TraceCheckUtils]: 96: Hoare triple {38179#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !(~x~0 % 4294967296 < 99); {38175#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:17,357 INFO L290 TraceCheckUtils]: 95: Hoare triple {38183#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38179#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,357 INFO L290 TraceCheckUtils]: 94: Hoare triple {38183#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38183#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-28 09:19:17,358 INFO L290 TraceCheckUtils]: 93: Hoare triple {38190#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38183#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-28 09:19:17,358 INFO L290 TraceCheckUtils]: 92: Hoare triple {38190#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38190#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,359 INFO L290 TraceCheckUtils]: 91: Hoare triple {38197#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38190#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,359 INFO L290 TraceCheckUtils]: 90: Hoare triple {38197#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38197#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,363 INFO L290 TraceCheckUtils]: 89: Hoare triple {38204#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38197#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,364 INFO L290 TraceCheckUtils]: 88: Hoare triple {38204#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38204#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,364 INFO L290 TraceCheckUtils]: 87: Hoare triple {38211#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38204#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,364 INFO L290 TraceCheckUtils]: 86: Hoare triple {38211#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38211#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-28 09:19:17,365 INFO L290 TraceCheckUtils]: 85: Hoare triple {38218#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38211#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-28 09:19:17,365 INFO L290 TraceCheckUtils]: 84: Hoare triple {38218#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38218#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-28 09:19:17,367 INFO L290 TraceCheckUtils]: 83: Hoare triple {38225#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38218#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-28 09:19:17,367 INFO L290 TraceCheckUtils]: 82: Hoare triple {38225#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38225#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-28 09:19:17,368 INFO L290 TraceCheckUtils]: 81: Hoare triple {38232#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38225#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-28 09:19:17,368 INFO L290 TraceCheckUtils]: 80: Hoare triple {38232#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38232#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,370 INFO L290 TraceCheckUtils]: 79: Hoare triple {38239#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38232#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,370 INFO L290 TraceCheckUtils]: 78: Hoare triple {38239#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38239#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-28 09:19:17,370 INFO L290 TraceCheckUtils]: 77: Hoare triple {38246#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38239#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-28 09:19:17,371 INFO L290 TraceCheckUtils]: 76: Hoare triple {38246#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38246#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,371 INFO L290 TraceCheckUtils]: 75: Hoare triple {38253#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38246#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,372 INFO L290 TraceCheckUtils]: 74: Hoare triple {38253#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38253#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,389 INFO L290 TraceCheckUtils]: 73: Hoare triple {38260#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38253#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,390 INFO L290 TraceCheckUtils]: 72: Hoare triple {38260#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38260#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,390 INFO L290 TraceCheckUtils]: 71: Hoare triple {38267#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38260#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,391 INFO L290 TraceCheckUtils]: 70: Hoare triple {38267#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38267#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,391 INFO L290 TraceCheckUtils]: 69: Hoare triple {38274#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38267#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {38274#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38274#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-28 09:19:17,392 INFO L290 TraceCheckUtils]: 67: Hoare triple {38281#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38274#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-28 09:19:17,392 INFO L290 TraceCheckUtils]: 66: Hoare triple {38281#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38281#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,393 INFO L290 TraceCheckUtils]: 65: Hoare triple {38288#(or (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38281#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,393 INFO L290 TraceCheckUtils]: 64: Hoare triple {38288#(or (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38288#(or (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {38295#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38288#(or (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,394 INFO L290 TraceCheckUtils]: 62: Hoare triple {38295#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38295#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,395 INFO L290 TraceCheckUtils]: 61: Hoare triple {38302#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38295#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,395 INFO L290 TraceCheckUtils]: 60: Hoare triple {38302#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38302#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {38309#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38302#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,396 INFO L290 TraceCheckUtils]: 58: Hoare triple {38309#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38309#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,397 INFO L290 TraceCheckUtils]: 57: Hoare triple {38316#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38309#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {38316#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38316#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,398 INFO L290 TraceCheckUtils]: 55: Hoare triple {38323#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38316#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {38323#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38323#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:17,399 INFO L290 TraceCheckUtils]: 53: Hoare triple {38330#(or (< (mod (+ 44 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38323#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:17,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {38330#(or (< (mod (+ 44 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {38330#(or (< (mod (+ 44 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,399 INFO L290 TraceCheckUtils]: 51: Hoare triple {38337#(or (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38330#(or (< (mod (+ 44 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:17,400 INFO L290 TraceCheckUtils]: 50: Hoare triple {38337#(or (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38337#(or (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {38344#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38337#(or (< (mod (+ main_~x~0 46) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,401 INFO L290 TraceCheckUtils]: 48: Hoare triple {38344#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38344#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,401 INFO L290 TraceCheckUtils]: 47: Hoare triple {38351#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38344#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {38351#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38351#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99))} is VALID [2022-04-28 09:19:17,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {38358#(or (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38351#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99))} is VALID [2022-04-28 09:19:17,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {38358#(or (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38358#(or (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {38365#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38358#(or (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {38365#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38365#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {38372#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38365#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {38372#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38372#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {38379#(or (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38372#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {38379#(or (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38379#(or (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {38386#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38379#(or (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {38386#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38386#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {38393#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38386#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {38393#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38393#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} is VALID [2022-04-28 09:19:17,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {38400#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38393#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} is VALID [2022-04-28 09:19:17,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {38400#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38400#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:17,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {38407#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 66 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38400#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:17,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {38407#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 66 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38407#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 66 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:17,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {38414#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38407#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 66 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:17,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {38414#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38414#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:17,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {38421#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 70) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38414#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:17,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {38421#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 70) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38421#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 70) 4294967296) 99))} is VALID [2022-04-28 09:19:17,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {38428#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38421#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 70) 4294967296) 99))} is VALID [2022-04-28 09:19:17,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {38428#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38428#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {38435#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 74) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38428#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {38435#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 74) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38435#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 74) 4294967296) 99))} is VALID [2022-04-28 09:19:17,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {38442#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38435#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 74) 4294967296) 99))} is VALID [2022-04-28 09:19:17,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {38442#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38442#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:17,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {38449#(or (< (mod (+ main_~x~0 78) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38442#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:17,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {38449#(or (< (mod (+ main_~x~0 78) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38449#(or (< (mod (+ main_~x~0 78) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {38456#(or (< (mod (+ main_~x~0 80) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38449#(or (< (mod (+ main_~x~0 78) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {38456#(or (< (mod (+ main_~x~0 80) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38456#(or (< (mod (+ main_~x~0 80) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {38463#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 82) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38456#(or (< (mod (+ main_~x~0 80) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {38463#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 82) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38463#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 82) 4294967296) 99))} is VALID [2022-04-28 09:19:17,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {38470#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 84 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38463#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 82) 4294967296) 99))} is VALID [2022-04-28 09:19:17,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {38470#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 84 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {38470#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 84 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:17,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {38477#(or (< (mod (+ main_~x~0 86) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38470#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 84 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:17,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {38477#(or (< (mod (+ main_~x~0 86) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38477#(or (< (mod (+ main_~x~0 86) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {38484#(or (< (mod (+ 88 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38477#(or (< (mod (+ main_~x~0 86) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {38484#(or (< (mod (+ 88 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38484#(or (< (mod (+ 88 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {38491#(or (< (mod (+ main_~x~0 90) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {38484#(or (< (mod (+ 88 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {38491#(or (< (mod (+ main_~x~0 90) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {38491#(or (< (mod (+ main_~x~0 90) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {37786#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {38491#(or (< (mod (+ main_~x~0 90) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:17,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {37786#true} call #t~ret6 := main(); {37786#true} is VALID [2022-04-28 09:19:17,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37786#true} {37786#true} #42#return; {37786#true} is VALID [2022-04-28 09:19:17,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {37786#true} assume true; {37786#true} is VALID [2022-04-28 09:19:17,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {37786#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(14, 2);call #Ultimate.allocInit(12, 3); {37786#true} is VALID [2022-04-28 09:19:17,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {37786#true} call ULTIMATE.init(); {37786#true} is VALID [2022-04-28 09:19:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:17,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394340846] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:19:17,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:19:17,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 51] total 121 [2022-04-28 09:19:17,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:19:17,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2056683767] [2022-04-28 09:19:17,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2056683767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:19:17,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:19:17,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 09:19:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724564855] [2022-04-28 09:19:17,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:19:17,450 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 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 101 [2022-04-28 09:19:17,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:19:17,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:17,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:17,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 09:19:17,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:17,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 09:19:17,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3355, Invalid=11165, Unknown=0, NotChecked=0, Total=14520 [2022-04-28 09:19:17,496 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:23,755 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-04-28 09:19:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 09:19:23,755 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 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 101 [2022-04-28 09:19:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:19:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 110 transitions. [2022-04-28 09:19:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 110 transitions. [2022-04-28 09:19:23,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 110 transitions. [2022-04-28 09:19:23,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:23,894 INFO L225 Difference]: With dead ends: 110 [2022-04-28 09:19:23,894 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 09:19:23,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5109 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5551, Invalid=22171, Unknown=0, NotChecked=0, Total=27722 [2022-04-28 09:19:23,896 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 99 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4218 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 4311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:19:23,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 133 Invalid, 4311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4218 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 09:19:23,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 09:19:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-04-28 09:19:24,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:19:24,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 104 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 99 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:24,401 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 104 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 99 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:24,401 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 104 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 99 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:24,402 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2022-04-28 09:19:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-04-28 09:19:24,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:19:24,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:19:24,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 99 states have internal predecessors, (100), 3 states have call successors, (3), 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 105 states. [2022-04-28 09:19:24,402 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 99 states have internal predecessors, (100), 3 states have call successors, (3), 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 105 states. [2022-04-28 09:19:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:24,403 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2022-04-28 09:19:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-04-28 09:19:24,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:19:24,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:19:24,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:19:24,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:19:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 99 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2022-04-28 09:19:24,404 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2022-04-28 09:19:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:19:24,405 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2022-04-28 09:19:24,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:24,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 104 transitions. [2022-04-28 09:19:24,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2022-04-28 09:19:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 09:19:24,542 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:19:24,542 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:19:24,548 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 09:19:24,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:19:24,748 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:19:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:19:24,748 INFO L85 PathProgramCache]: Analyzing trace with hash -402777186, now seen corresponding path program 91 times [2022-04-28 09:19:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:24,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1228006418] [2022-04-28 09:19:24,750 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:19:24,750 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:19:24,750 INFO L85 PathProgramCache]: Analyzing trace with hash -402777186, now seen corresponding path program 92 times [2022-04-28 09:19:24,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:19:24,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930747795] [2022-04-28 09:19:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:19:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:19:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:25,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:19:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:25,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {39297#(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(14, 2);call #Ultimate.allocInit(12, 3); {39245#true} is VALID [2022-04-28 09:19:25,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {39245#true} assume true; {39245#true} is VALID [2022-04-28 09:19:25,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39245#true} {39245#true} #42#return; {39245#true} is VALID [2022-04-28 09:19:25,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {39245#true} call ULTIMATE.init(); {39297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:19:25,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {39297#(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(14, 2);call #Ultimate.allocInit(12, 3); {39245#true} is VALID [2022-04-28 09:19:25,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {39245#true} assume true; {39245#true} is VALID [2022-04-28 09:19:25,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39245#true} {39245#true} #42#return; {39245#true} is VALID [2022-04-28 09:19:25,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {39245#true} call #t~ret6 := main(); {39245#true} is VALID [2022-04-28 09:19:25,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {39245#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {39250#(= main_~x~0 0)} is VALID [2022-04-28 09:19:25,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {39250#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {39250#(= main_~x~0 0)} is VALID [2022-04-28 09:19:25,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {39250#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:25,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {39251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {39251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:25,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {39251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39252#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:25,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {39252#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39252#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:25,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {39252#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39253#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:25,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {39253#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {39253#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:25,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {39253#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39254#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:25,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {39254#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39254#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:25,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {39254#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39255#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:25,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {39255#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39255#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:25,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {39255#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:25,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {39256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:25,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {39256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39257#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:25,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {39257#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {39257#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:25,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {39257#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39258#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:25,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {39258#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39258#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:25,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {39258#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39259#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:25,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {39259#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39259#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:25,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {39259#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39260#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:25,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {39260#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39260#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:25,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {39260#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39261#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:25,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {39261#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {39261#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:25,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {39261#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39262#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:25,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {39262#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39262#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:25,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {39262#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39263#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:25,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {39263#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39263#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:25,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {39263#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39264#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:25,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {39264#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {39264#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:25,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {39264#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39265#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:25,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {39265#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {39265#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:25,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {39265#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39266#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:25,890 INFO L290 TraceCheckUtils]: 38: Hoare triple {39266#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39266#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:25,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {39266#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39267#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:25,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {39267#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39267#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:25,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {39267#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39268#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:25,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {39268#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39268#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:25,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {39268#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39269#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:25,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {39269#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39269#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:25,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {39269#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39270#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:25,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {39270#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39270#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:25,893 INFO L290 TraceCheckUtils]: 47: Hoare triple {39270#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39271#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:25,893 INFO L290 TraceCheckUtils]: 48: Hoare triple {39271#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39271#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:25,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {39271#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39272#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:25,894 INFO L290 TraceCheckUtils]: 50: Hoare triple {39272#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {39272#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:25,894 INFO L290 TraceCheckUtils]: 51: Hoare triple {39272#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39273#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:25,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {39273#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {39273#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:25,895 INFO L290 TraceCheckUtils]: 53: Hoare triple {39273#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39274#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:25,895 INFO L290 TraceCheckUtils]: 54: Hoare triple {39274#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39274#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:25,896 INFO L290 TraceCheckUtils]: 55: Hoare triple {39274#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39275#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:19:25,896 INFO L290 TraceCheckUtils]: 56: Hoare triple {39275#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39275#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:19:25,896 INFO L290 TraceCheckUtils]: 57: Hoare triple {39275#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39276#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:19:25,897 INFO L290 TraceCheckUtils]: 58: Hoare triple {39276#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39276#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:19:25,897 INFO L290 TraceCheckUtils]: 59: Hoare triple {39276#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39277#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:25,897 INFO L290 TraceCheckUtils]: 60: Hoare triple {39277#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39277#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:25,898 INFO L290 TraceCheckUtils]: 61: Hoare triple {39277#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39278#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:25,898 INFO L290 TraceCheckUtils]: 62: Hoare triple {39278#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39278#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:25,898 INFO L290 TraceCheckUtils]: 63: Hoare triple {39278#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39279#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:25,899 INFO L290 TraceCheckUtils]: 64: Hoare triple {39279#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {39279#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:25,899 INFO L290 TraceCheckUtils]: 65: Hoare triple {39279#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39280#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:19:25,900 INFO L290 TraceCheckUtils]: 66: Hoare triple {39280#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39280#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:19:25,901 INFO L290 TraceCheckUtils]: 67: Hoare triple {39280#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39281#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:25,901 INFO L290 TraceCheckUtils]: 68: Hoare triple {39281#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {39281#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:25,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {39281#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39282#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:19:25,902 INFO L290 TraceCheckUtils]: 70: Hoare triple {39282#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39282#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:19:25,902 INFO L290 TraceCheckUtils]: 71: Hoare triple {39282#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39283#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:25,902 INFO L290 TraceCheckUtils]: 72: Hoare triple {39283#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {39283#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:25,903 INFO L290 TraceCheckUtils]: 73: Hoare triple {39283#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39284#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:19:25,903 INFO L290 TraceCheckUtils]: 74: Hoare triple {39284#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39284#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:19:25,903 INFO L290 TraceCheckUtils]: 75: Hoare triple {39284#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39285#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:25,904 INFO L290 TraceCheckUtils]: 76: Hoare triple {39285#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39285#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:25,904 INFO L290 TraceCheckUtils]: 77: Hoare triple {39285#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39286#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:25,904 INFO L290 TraceCheckUtils]: 78: Hoare triple {39286#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {39286#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:25,905 INFO L290 TraceCheckUtils]: 79: Hoare triple {39286#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39287#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:25,905 INFO L290 TraceCheckUtils]: 80: Hoare triple {39287#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {39287#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:25,906 INFO L290 TraceCheckUtils]: 81: Hoare triple {39287#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39288#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:19:25,906 INFO L290 TraceCheckUtils]: 82: Hoare triple {39288#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {39288#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:19:25,906 INFO L290 TraceCheckUtils]: 83: Hoare triple {39288#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39289#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:25,907 INFO L290 TraceCheckUtils]: 84: Hoare triple {39289#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {39289#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:25,907 INFO L290 TraceCheckUtils]: 85: Hoare triple {39289#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39290#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:25,907 INFO L290 TraceCheckUtils]: 86: Hoare triple {39290#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {39290#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:25,908 INFO L290 TraceCheckUtils]: 87: Hoare triple {39290#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39291#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:19:25,908 INFO L290 TraceCheckUtils]: 88: Hoare triple {39291#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {39291#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:19:25,908 INFO L290 TraceCheckUtils]: 89: Hoare triple {39291#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39292#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:19:25,909 INFO L290 TraceCheckUtils]: 90: Hoare triple {39292#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 99); {39292#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:19:25,909 INFO L290 TraceCheckUtils]: 91: Hoare triple {39292#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39293#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:19:25,909 INFO L290 TraceCheckUtils]: 92: Hoare triple {39293#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39293#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:19:25,910 INFO L290 TraceCheckUtils]: 93: Hoare triple {39293#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39294#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:25,910 INFO L290 TraceCheckUtils]: 94: Hoare triple {39294#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39294#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:25,911 INFO L290 TraceCheckUtils]: 95: Hoare triple {39294#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39295#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 09:19:25,911 INFO L290 TraceCheckUtils]: 96: Hoare triple {39295#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 99); {39295#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 09:19:25,911 INFO L290 TraceCheckUtils]: 97: Hoare triple {39295#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39296#(and (<= main_~x~0 92) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:19:25,912 INFO L290 TraceCheckUtils]: 98: Hoare triple {39296#(and (<= main_~x~0 92) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {39246#false} is VALID [2022-04-28 09:19:25,912 INFO L272 TraceCheckUtils]: 99: Hoare triple {39246#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {39246#false} is VALID [2022-04-28 09:19:25,912 INFO L290 TraceCheckUtils]: 100: Hoare triple {39246#false} ~cond := #in~cond; {39246#false} is VALID [2022-04-28 09:19:25,912 INFO L290 TraceCheckUtils]: 101: Hoare triple {39246#false} assume 0 == ~cond; {39246#false} is VALID [2022-04-28 09:19:25,912 INFO L290 TraceCheckUtils]: 102: Hoare triple {39246#false} assume !false; {39246#false} is VALID [2022-04-28 09:19:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:25,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:19:25,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930747795] [2022-04-28 09:19:25,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930747795] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:19:25,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492854638] [2022-04-28 09:19:25,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:19:25,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:19:25,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:19:25,914 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 09:19:25,915 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 09:19:25,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:19:25,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:19:25,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-28 09:19:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:25,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:19:26,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {39245#true} call ULTIMATE.init(); {39245#true} is VALID [2022-04-28 09:19:26,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {39245#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(14, 2);call #Ultimate.allocInit(12, 3); {39245#true} is VALID [2022-04-28 09:19:26,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {39245#true} assume true; {39245#true} is VALID [2022-04-28 09:19:26,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39245#true} {39245#true} #42#return; {39245#true} is VALID [2022-04-28 09:19:26,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {39245#true} call #t~ret6 := main(); {39245#true} is VALID [2022-04-28 09:19:26,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {39245#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {39250#(= main_~x~0 0)} is VALID [2022-04-28 09:19:26,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {39250#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {39250#(= main_~x~0 0)} is VALID [2022-04-28 09:19:26,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {39250#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:26,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {39251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {39251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:26,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {39251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39252#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:26,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {39252#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39252#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:26,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {39252#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39253#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:26,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {39253#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {39253#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:26,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {39253#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39254#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:26,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {39254#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39254#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:26,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {39254#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39255#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:26,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {39255#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39255#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:26,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {39255#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:26,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {39256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:26,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {39256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39257#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:26,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {39257#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {39257#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:26,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {39257#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39258#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:26,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {39258#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39258#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:26,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {39258#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39259#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:26,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {39259#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39259#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:26,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {39259#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39260#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:26,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {39260#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39260#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:26,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {39260#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39261#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:26,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {39261#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {39261#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:26,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {39261#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39262#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:26,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {39262#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39262#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:26,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {39262#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39263#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:26,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {39263#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39263#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:26,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {39263#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39264#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:26,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {39264#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {39264#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:26,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {39264#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39265#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:26,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {39265#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {39265#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:26,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {39265#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39266#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:26,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {39266#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39266#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:26,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {39266#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39267#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:26,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {39267#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39267#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:26,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {39267#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39268#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:26,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {39268#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39268#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:26,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {39268#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39269#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:26,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {39269#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39269#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:26,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {39269#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39270#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:26,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {39270#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39270#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:26,728 INFO L290 TraceCheckUtils]: 47: Hoare triple {39270#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39271#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:26,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {39271#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39271#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:26,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {39271#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39272#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:26,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {39272#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {39272#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:26,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {39272#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39273#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:26,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {39273#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {39273#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:26,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {39273#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39274#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:26,730 INFO L290 TraceCheckUtils]: 54: Hoare triple {39274#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39274#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:26,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {39274#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39275#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:19:26,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {39275#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39275#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:19:26,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {39275#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39276#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:19:26,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {39276#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39276#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:19:26,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {39276#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39277#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:26,732 INFO L290 TraceCheckUtils]: 60: Hoare triple {39277#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39277#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:26,732 INFO L290 TraceCheckUtils]: 61: Hoare triple {39277#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39278#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:26,732 INFO L290 TraceCheckUtils]: 62: Hoare triple {39278#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39278#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:26,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {39278#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39279#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:26,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {39279#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {39279#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:26,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {39279#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39280#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:19:26,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {39280#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39280#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:19:26,734 INFO L290 TraceCheckUtils]: 67: Hoare triple {39280#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39281#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:26,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {39281#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {39281#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:26,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {39281#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39282#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:19:26,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {39282#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39282#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:19:26,735 INFO L290 TraceCheckUtils]: 71: Hoare triple {39282#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39283#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:26,735 INFO L290 TraceCheckUtils]: 72: Hoare triple {39283#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {39283#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:26,735 INFO L290 TraceCheckUtils]: 73: Hoare triple {39283#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39284#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:19:26,736 INFO L290 TraceCheckUtils]: 74: Hoare triple {39284#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39284#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:19:26,736 INFO L290 TraceCheckUtils]: 75: Hoare triple {39284#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39285#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:26,736 INFO L290 TraceCheckUtils]: 76: Hoare triple {39285#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39285#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:26,736 INFO L290 TraceCheckUtils]: 77: Hoare triple {39285#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39286#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:26,737 INFO L290 TraceCheckUtils]: 78: Hoare triple {39286#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {39286#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:26,737 INFO L290 TraceCheckUtils]: 79: Hoare triple {39286#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39287#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:26,737 INFO L290 TraceCheckUtils]: 80: Hoare triple {39287#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {39287#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:26,738 INFO L290 TraceCheckUtils]: 81: Hoare triple {39287#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39288#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:19:26,738 INFO L290 TraceCheckUtils]: 82: Hoare triple {39288#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {39288#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:19:26,738 INFO L290 TraceCheckUtils]: 83: Hoare triple {39288#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39289#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:26,738 INFO L290 TraceCheckUtils]: 84: Hoare triple {39289#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {39289#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:26,739 INFO L290 TraceCheckUtils]: 85: Hoare triple {39289#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39290#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:26,739 INFO L290 TraceCheckUtils]: 86: Hoare triple {39290#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {39290#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:26,739 INFO L290 TraceCheckUtils]: 87: Hoare triple {39290#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39291#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:19:26,740 INFO L290 TraceCheckUtils]: 88: Hoare triple {39291#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {39291#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:19:26,740 INFO L290 TraceCheckUtils]: 89: Hoare triple {39291#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39292#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:19:26,740 INFO L290 TraceCheckUtils]: 90: Hoare triple {39292#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 99); {39292#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:19:26,740 INFO L290 TraceCheckUtils]: 91: Hoare triple {39292#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39293#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:19:26,741 INFO L290 TraceCheckUtils]: 92: Hoare triple {39293#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39293#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:19:26,741 INFO L290 TraceCheckUtils]: 93: Hoare triple {39293#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39294#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:26,741 INFO L290 TraceCheckUtils]: 94: Hoare triple {39294#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {39294#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:26,742 INFO L290 TraceCheckUtils]: 95: Hoare triple {39294#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39295#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 09:19:26,742 INFO L290 TraceCheckUtils]: 96: Hoare triple {39295#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 99); {39295#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 09:19:26,742 INFO L290 TraceCheckUtils]: 97: Hoare triple {39295#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39592#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 09:19:26,742 INFO L290 TraceCheckUtils]: 98: Hoare triple {39592#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {39246#false} is VALID [2022-04-28 09:19:26,743 INFO L272 TraceCheckUtils]: 99: Hoare triple {39246#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {39246#false} is VALID [2022-04-28 09:19:26,743 INFO L290 TraceCheckUtils]: 100: Hoare triple {39246#false} ~cond := #in~cond; {39246#false} is VALID [2022-04-28 09:19:26,743 INFO L290 TraceCheckUtils]: 101: Hoare triple {39246#false} assume 0 == ~cond; {39246#false} is VALID [2022-04-28 09:19:26,743 INFO L290 TraceCheckUtils]: 102: Hoare triple {39246#false} assume !false; {39246#false} is VALID [2022-04-28 09:19:26,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:26,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:19:28,711 INFO L290 TraceCheckUtils]: 102: Hoare triple {39246#false} assume !false; {39246#false} is VALID [2022-04-28 09:19:28,711 INFO L290 TraceCheckUtils]: 101: Hoare triple {39246#false} assume 0 == ~cond; {39246#false} is VALID [2022-04-28 09:19:28,711 INFO L290 TraceCheckUtils]: 100: Hoare triple {39246#false} ~cond := #in~cond; {39246#false} is VALID [2022-04-28 09:19:28,712 INFO L272 TraceCheckUtils]: 99: Hoare triple {39246#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {39246#false} is VALID [2022-04-28 09:19:28,712 INFO L290 TraceCheckUtils]: 98: Hoare triple {39620#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {39246#false} is VALID [2022-04-28 09:19:28,712 INFO L290 TraceCheckUtils]: 97: Hoare triple {39624#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39620#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:19:28,712 INFO L290 TraceCheckUtils]: 96: Hoare triple {39624#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39624#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:19:28,713 INFO L290 TraceCheckUtils]: 95: Hoare triple {39631#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39624#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:19:28,713 INFO L290 TraceCheckUtils]: 94: Hoare triple {39631#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39631#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:19:28,714 INFO L290 TraceCheckUtils]: 93: Hoare triple {39638#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39631#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:19:28,714 INFO L290 TraceCheckUtils]: 92: Hoare triple {39638#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39638#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:19:28,714 INFO L290 TraceCheckUtils]: 91: Hoare triple {39645#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39638#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:19:28,715 INFO L290 TraceCheckUtils]: 90: Hoare triple {39645#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39645#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:19:28,715 INFO L290 TraceCheckUtils]: 89: Hoare triple {39652#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39645#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:19:28,715 INFO L290 TraceCheckUtils]: 88: Hoare triple {39652#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39652#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:19:28,716 INFO L290 TraceCheckUtils]: 87: Hoare triple {39659#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39652#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:19:28,716 INFO L290 TraceCheckUtils]: 86: Hoare triple {39659#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39659#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:19:28,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {39666#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39659#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:19:28,717 INFO L290 TraceCheckUtils]: 84: Hoare triple {39666#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39666#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:19:28,717 INFO L290 TraceCheckUtils]: 83: Hoare triple {39673#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39666#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:19:28,718 INFO L290 TraceCheckUtils]: 82: Hoare triple {39673#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39673#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:19:28,718 INFO L290 TraceCheckUtils]: 81: Hoare triple {39680#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39673#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:19:28,718 INFO L290 TraceCheckUtils]: 80: Hoare triple {39680#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39680#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:19:28,719 INFO L290 TraceCheckUtils]: 79: Hoare triple {39687#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39680#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:19:28,719 INFO L290 TraceCheckUtils]: 78: Hoare triple {39687#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39687#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:19:28,719 INFO L290 TraceCheckUtils]: 77: Hoare triple {39694#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39687#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:19:28,720 INFO L290 TraceCheckUtils]: 76: Hoare triple {39694#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39694#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:19:28,720 INFO L290 TraceCheckUtils]: 75: Hoare triple {39701#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39694#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:19:28,720 INFO L290 TraceCheckUtils]: 74: Hoare triple {39701#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39701#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:19:28,721 INFO L290 TraceCheckUtils]: 73: Hoare triple {39708#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39701#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:19:28,721 INFO L290 TraceCheckUtils]: 72: Hoare triple {39708#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39708#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:19:28,721 INFO L290 TraceCheckUtils]: 71: Hoare triple {39715#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39708#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:19:28,722 INFO L290 TraceCheckUtils]: 70: Hoare triple {39715#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39715#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-28 09:19:28,722 INFO L290 TraceCheckUtils]: 69: Hoare triple {39722#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39715#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-28 09:19:28,722 INFO L290 TraceCheckUtils]: 68: Hoare triple {39722#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39722#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,723 INFO L290 TraceCheckUtils]: 67: Hoare triple {39729#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39722#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,723 INFO L290 TraceCheckUtils]: 66: Hoare triple {39729#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39729#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {39736#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39729#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,724 INFO L290 TraceCheckUtils]: 64: Hoare triple {39736#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39736#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-28 09:19:28,724 INFO L290 TraceCheckUtils]: 63: Hoare triple {39743#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39736#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-28 09:19:28,724 INFO L290 TraceCheckUtils]: 62: Hoare triple {39743#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39743#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-28 09:19:28,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {39750#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39743#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-28 09:19:28,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {39750#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39750#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-28 09:19:28,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {39757#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39750#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-28 09:19:28,726 INFO L290 TraceCheckUtils]: 58: Hoare triple {39757#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39757#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {39764#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39757#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {39764#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39764#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,727 INFO L290 TraceCheckUtils]: 55: Hoare triple {39771#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39764#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,727 INFO L290 TraceCheckUtils]: 54: Hoare triple {39771#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39771#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,727 INFO L290 TraceCheckUtils]: 53: Hoare triple {39778#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39771#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {39778#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39778#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-28 09:19:28,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {39785#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39778#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-28 09:19:28,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {39785#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39785#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-28 09:19:28,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {39792#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39785#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-28 09:19:28,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {39792#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39792#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-28 09:19:28,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {39799#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39792#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-28 09:19:28,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {39799#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39799#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-28 09:19:28,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {39806#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39799#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-28 09:19:28,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {39806#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39806#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-28 09:19:28,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {39813#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39806#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-28 09:19:28,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {39813#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39813#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {39820#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39813#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {39820#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39820#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-28 09:19:28,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {39827#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39820#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-28 09:19:28,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {39827#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39827#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-28 09:19:28,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {39834#(< (mod (+ main_~x~0 62) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39827#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-28 09:19:28,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {39834#(< (mod (+ main_~x~0 62) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39834#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-28 09:19:28,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {39841#(< (mod (+ 64 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39834#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-28 09:19:28,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {39841#(< (mod (+ 64 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39841#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {39848#(< (mod (+ 66 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39841#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {39848#(< (mod (+ 66 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39848#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {39855#(< (mod (+ 68 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39848#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {39855#(< (mod (+ 68 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39855#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {39862#(< (mod (+ main_~x~0 70) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39855#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {39862#(< (mod (+ main_~x~0 70) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39862#(< (mod (+ main_~x~0 70) 4294967296) 99)} is VALID [2022-04-28 09:19:28,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {39869#(< (mod (+ 72 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39862#(< (mod (+ main_~x~0 70) 4294967296) 99)} is VALID [2022-04-28 09:19:28,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {39869#(< (mod (+ 72 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39869#(< (mod (+ 72 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {39876#(< (mod (+ main_~x~0 74) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39869#(< (mod (+ 72 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {39876#(< (mod (+ main_~x~0 74) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39876#(< (mod (+ main_~x~0 74) 4294967296) 99)} is VALID [2022-04-28 09:19:28,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {39883#(< (mod (+ 76 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39876#(< (mod (+ main_~x~0 74) 4294967296) 99)} is VALID [2022-04-28 09:19:28,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {39883#(< (mod (+ 76 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39883#(< (mod (+ 76 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {39890#(< (mod (+ main_~x~0 78) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39883#(< (mod (+ 76 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {39890#(< (mod (+ main_~x~0 78) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39890#(< (mod (+ main_~x~0 78) 4294967296) 99)} is VALID [2022-04-28 09:19:28,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {39897#(< (mod (+ main_~x~0 80) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39890#(< (mod (+ main_~x~0 78) 4294967296) 99)} is VALID [2022-04-28 09:19:28,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {39897#(< (mod (+ main_~x~0 80) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39897#(< (mod (+ main_~x~0 80) 4294967296) 99)} is VALID [2022-04-28 09:19:28,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {39904#(< (mod (+ main_~x~0 82) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39897#(< (mod (+ main_~x~0 80) 4294967296) 99)} is VALID [2022-04-28 09:19:28,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {39904#(< (mod (+ main_~x~0 82) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39904#(< (mod (+ main_~x~0 82) 4294967296) 99)} is VALID [2022-04-28 09:19:28,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {39911#(< (mod (+ 84 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39904#(< (mod (+ main_~x~0 82) 4294967296) 99)} is VALID [2022-04-28 09:19:28,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {39911#(< (mod (+ 84 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39911#(< (mod (+ 84 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {39918#(< (mod (+ main_~x~0 86) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39911#(< (mod (+ 84 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {39918#(< (mod (+ main_~x~0 86) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39918#(< (mod (+ main_~x~0 86) 4294967296) 99)} is VALID [2022-04-28 09:19:28,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {39925#(< (mod (+ 88 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39918#(< (mod (+ main_~x~0 86) 4294967296) 99)} is VALID [2022-04-28 09:19:28,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {39925#(< (mod (+ 88 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39925#(< (mod (+ 88 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {39932#(< (mod (+ main_~x~0 90) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39925#(< (mod (+ 88 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {39932#(< (mod (+ main_~x~0 90) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39932#(< (mod (+ main_~x~0 90) 4294967296) 99)} is VALID [2022-04-28 09:19:28,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {39939#(< (mod (+ 92 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {39932#(< (mod (+ main_~x~0 90) 4294967296) 99)} is VALID [2022-04-28 09:19:28,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {39939#(< (mod (+ 92 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {39939#(< (mod (+ 92 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {39245#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {39939#(< (mod (+ 92 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:19:28,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {39245#true} call #t~ret6 := main(); {39245#true} is VALID [2022-04-28 09:19:28,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39245#true} {39245#true} #42#return; {39245#true} is VALID [2022-04-28 09:19:28,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {39245#true} assume true; {39245#true} is VALID [2022-04-28 09:19:28,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {39245#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(14, 2);call #Ultimate.allocInit(12, 3); {39245#true} is VALID [2022-04-28 09:19:28,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {39245#true} call ULTIMATE.init(); {39245#true} is VALID [2022-04-28 09:19:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:28,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492854638] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:19:28,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:19:28,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-28 09:19:28,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:19:28,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1228006418] [2022-04-28 09:19:28,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1228006418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:19:28,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:19:28,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 09:19:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594312370] [2022-04-28 09:19:28,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:19:28,745 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 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 103 [2022-04-28 09:19:28,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:19:28,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:28,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:28,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 09:19:28,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:28,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 09:19:28,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1507, Invalid=7999, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 09:19:28,791 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:35,069 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-28 09:19:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 09:19:35,069 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 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 103 [2022-04-28 09:19:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:19:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 112 transitions. [2022-04-28 09:19:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 112 transitions. [2022-04-28 09:19:35,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 112 transitions. [2022-04-28 09:19:35,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:35,136 INFO L225 Difference]: With dead ends: 112 [2022-04-28 09:19:35,136 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 09:19:35,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2253 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3050, Invalid=17830, Unknown=0, NotChecked=0, Total=20880 [2022-04-28 09:19:35,139 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 101 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 4491 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 4586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 4491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:19:35,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 223 Invalid, 4586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 4491 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 09:19:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 09:19:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2022-04-28 09:19:35,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:19:35,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 106 states, 101 states have (on average 1.00990099009901) internal successors, (102), 101 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:35,550 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 106 states, 101 states have (on average 1.00990099009901) internal successors, (102), 101 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:35,550 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 106 states, 101 states have (on average 1.00990099009901) internal successors, (102), 101 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:35,551 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2022-04-28 09:19:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2022-04-28 09:19:35,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:19:35,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:19:35,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.00990099009901) internal successors, (102), 101 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-28 09:19:35,552 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.00990099009901) internal successors, (102), 101 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-28 09:19:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:35,555 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2022-04-28 09:19:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2022-04-28 09:19:35,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:19:35,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:19:35,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:19:35,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:19:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.00990099009901) internal successors, (102), 101 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2022-04-28 09:19:35,556 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2022-04-28 09:19:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:19:35,556 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2022-04-28 09:19:35,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:35,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 106 transitions. [2022-04-28 09:19:35,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2022-04-28 09:19:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 09:19:35,724 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:19:35,724 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:19:35,742 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 09:19:35,924 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,SelfDestructingSolverStorable55 [2022-04-28 09:19:35,924 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:19:35,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:19:35,925 INFO L85 PathProgramCache]: Analyzing trace with hash 520147099, now seen corresponding path program 93 times [2022-04-28 09:19:35,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:35,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [412218144] [2022-04-28 09:19:35,927 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:19:35,927 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:19:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash 520147099, now seen corresponding path program 94 times [2022-04-28 09:19:35,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:19:35,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4528439] [2022-04-28 09:19:35,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:19:35,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:19:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:36,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:19:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:36,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {40760#(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(14, 2);call #Ultimate.allocInit(12, 3); {40707#true} is VALID [2022-04-28 09:19:36,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {40707#true} assume true; {40707#true} is VALID [2022-04-28 09:19:36,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40707#true} {40707#true} #42#return; {40707#true} is VALID [2022-04-28 09:19:36,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {40707#true} call ULTIMATE.init(); {40760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:19:36,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {40760#(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(14, 2);call #Ultimate.allocInit(12, 3); {40707#true} is VALID [2022-04-28 09:19:36,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {40707#true} assume true; {40707#true} is VALID [2022-04-28 09:19:36,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40707#true} {40707#true} #42#return; {40707#true} is VALID [2022-04-28 09:19:36,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {40707#true} call #t~ret6 := main(); {40707#true} is VALID [2022-04-28 09:19:36,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {40707#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {40712#(= main_~x~0 0)} is VALID [2022-04-28 09:19:36,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {40712#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {40712#(= main_~x~0 0)} is VALID [2022-04-28 09:19:36,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {40712#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40713#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:36,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {40713#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {40713#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:36,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {40713#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40714#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:36,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {40714#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40714#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:36,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {40714#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40715#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:36,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {40715#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {40715#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:36,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {40715#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40716#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:36,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {40716#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40716#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:36,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {40716#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40717#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:36,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {40717#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40717#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:36,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {40717#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40718#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:36,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {40718#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40718#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:36,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {40718#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40719#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:36,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {40719#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {40719#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:36,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {40719#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40720#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:36,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {40720#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40720#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:36,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {40720#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40721#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:36,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {40721#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40721#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:36,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {40721#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40722#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:36,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {40722#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40722#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:36,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {40722#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40723#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:36,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {40723#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {40723#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:36,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {40723#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40724#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:36,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {40724#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40724#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:36,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {40724#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40725#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:36,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {40725#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40725#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:36,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {40725#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40726#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:36,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {40726#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {40726#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:36,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {40726#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40727#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:36,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {40727#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {40727#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:36,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {40727#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40728#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:36,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {40728#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40728#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:36,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {40728#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40729#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:36,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {40729#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40729#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:36,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {40729#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40730#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:36,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {40730#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40730#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:36,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {40730#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40731#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:36,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {40731#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40731#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:36,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {40731#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40732#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:36,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {40732#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40732#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:36,803 INFO L290 TraceCheckUtils]: 47: Hoare triple {40732#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40733#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:36,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {40733#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40733#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:36,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {40733#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40734#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:36,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {40734#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {40734#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:36,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {40734#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40735#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:36,805 INFO L290 TraceCheckUtils]: 52: Hoare triple {40735#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {40735#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:36,805 INFO L290 TraceCheckUtils]: 53: Hoare triple {40735#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40736#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:36,805 INFO L290 TraceCheckUtils]: 54: Hoare triple {40736#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40736#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:36,805 INFO L290 TraceCheckUtils]: 55: Hoare triple {40736#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40737#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:19:36,806 INFO L290 TraceCheckUtils]: 56: Hoare triple {40737#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40737#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:19:36,806 INFO L290 TraceCheckUtils]: 57: Hoare triple {40737#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40738#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:19:36,806 INFO L290 TraceCheckUtils]: 58: Hoare triple {40738#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40738#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:19:36,807 INFO L290 TraceCheckUtils]: 59: Hoare triple {40738#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40739#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:36,807 INFO L290 TraceCheckUtils]: 60: Hoare triple {40739#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40739#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:36,807 INFO L290 TraceCheckUtils]: 61: Hoare triple {40739#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40740#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:36,807 INFO L290 TraceCheckUtils]: 62: Hoare triple {40740#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40740#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:36,808 INFO L290 TraceCheckUtils]: 63: Hoare triple {40740#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40741#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:36,808 INFO L290 TraceCheckUtils]: 64: Hoare triple {40741#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {40741#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:36,808 INFO L290 TraceCheckUtils]: 65: Hoare triple {40741#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40742#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:19:36,808 INFO L290 TraceCheckUtils]: 66: Hoare triple {40742#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40742#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:19:36,809 INFO L290 TraceCheckUtils]: 67: Hoare triple {40742#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40743#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:36,809 INFO L290 TraceCheckUtils]: 68: Hoare triple {40743#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {40743#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:36,809 INFO L290 TraceCheckUtils]: 69: Hoare triple {40743#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40744#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:19:36,810 INFO L290 TraceCheckUtils]: 70: Hoare triple {40744#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40744#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:19:36,810 INFO L290 TraceCheckUtils]: 71: Hoare triple {40744#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40745#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:36,810 INFO L290 TraceCheckUtils]: 72: Hoare triple {40745#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {40745#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:36,810 INFO L290 TraceCheckUtils]: 73: Hoare triple {40745#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40746#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:19:36,811 INFO L290 TraceCheckUtils]: 74: Hoare triple {40746#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40746#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:19:36,811 INFO L290 TraceCheckUtils]: 75: Hoare triple {40746#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40747#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:36,811 INFO L290 TraceCheckUtils]: 76: Hoare triple {40747#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40747#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:36,812 INFO L290 TraceCheckUtils]: 77: Hoare triple {40747#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40748#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:36,812 INFO L290 TraceCheckUtils]: 78: Hoare triple {40748#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {40748#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:36,812 INFO L290 TraceCheckUtils]: 79: Hoare triple {40748#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40749#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:36,812 INFO L290 TraceCheckUtils]: 80: Hoare triple {40749#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {40749#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:36,813 INFO L290 TraceCheckUtils]: 81: Hoare triple {40749#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40750#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:19:36,813 INFO L290 TraceCheckUtils]: 82: Hoare triple {40750#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {40750#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:19:36,813 INFO L290 TraceCheckUtils]: 83: Hoare triple {40750#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40751#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:36,813 INFO L290 TraceCheckUtils]: 84: Hoare triple {40751#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {40751#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:36,814 INFO L290 TraceCheckUtils]: 85: Hoare triple {40751#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40752#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:36,814 INFO L290 TraceCheckUtils]: 86: Hoare triple {40752#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {40752#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:36,814 INFO L290 TraceCheckUtils]: 87: Hoare triple {40752#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40753#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:19:36,815 INFO L290 TraceCheckUtils]: 88: Hoare triple {40753#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {40753#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:19:36,815 INFO L290 TraceCheckUtils]: 89: Hoare triple {40753#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40754#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:19:36,815 INFO L290 TraceCheckUtils]: 90: Hoare triple {40754#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 99); {40754#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:19:36,815 INFO L290 TraceCheckUtils]: 91: Hoare triple {40754#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40755#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:19:36,816 INFO L290 TraceCheckUtils]: 92: Hoare triple {40755#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40755#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:19:36,816 INFO L290 TraceCheckUtils]: 93: Hoare triple {40755#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40756#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:36,816 INFO L290 TraceCheckUtils]: 94: Hoare triple {40756#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40756#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:36,817 INFO L290 TraceCheckUtils]: 95: Hoare triple {40756#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40757#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 09:19:36,817 INFO L290 TraceCheckUtils]: 96: Hoare triple {40757#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 99); {40757#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 09:19:36,817 INFO L290 TraceCheckUtils]: 97: Hoare triple {40757#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40758#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 09:19:36,817 INFO L290 TraceCheckUtils]: 98: Hoare triple {40758#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40758#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 09:19:36,818 INFO L290 TraceCheckUtils]: 99: Hoare triple {40758#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40759#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 94))} is VALID [2022-04-28 09:19:36,818 INFO L290 TraceCheckUtils]: 100: Hoare triple {40759#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 94))} assume !(~x~0 % 4294967296 < 99); {40708#false} is VALID [2022-04-28 09:19:36,818 INFO L272 TraceCheckUtils]: 101: Hoare triple {40708#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {40708#false} is VALID [2022-04-28 09:19:36,818 INFO L290 TraceCheckUtils]: 102: Hoare triple {40708#false} ~cond := #in~cond; {40708#false} is VALID [2022-04-28 09:19:36,818 INFO L290 TraceCheckUtils]: 103: Hoare triple {40708#false} assume 0 == ~cond; {40708#false} is VALID [2022-04-28 09:19:36,818 INFO L290 TraceCheckUtils]: 104: Hoare triple {40708#false} assume !false; {40708#false} is VALID [2022-04-28 09:19:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:36,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:19:36,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4528439] [2022-04-28 09:19:36,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4528439] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:19:36,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034457265] [2022-04-28 09:19:36,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:19:36,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:19:36,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:19:36,820 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 09:19:36,821 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 09:19:36,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:19:36,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:19:36,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-28 09:19:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:36,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:19:38,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {40707#true} call ULTIMATE.init(); {40707#true} is VALID [2022-04-28 09:19:38,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {40707#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(14, 2);call #Ultimate.allocInit(12, 3); {40707#true} is VALID [2022-04-28 09:19:38,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {40707#true} assume true; {40707#true} is VALID [2022-04-28 09:19:38,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40707#true} {40707#true} #42#return; {40707#true} is VALID [2022-04-28 09:19:38,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {40707#true} call #t~ret6 := main(); {40707#true} is VALID [2022-04-28 09:19:38,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {40707#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {40712#(= main_~x~0 0)} is VALID [2022-04-28 09:19:38,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {40712#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {40712#(= main_~x~0 0)} is VALID [2022-04-28 09:19:38,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {40712#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40785#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {40785#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40785#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {40785#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40792#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-28 09:19:38,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {40792#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {40792#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-28 09:19:38,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {40792#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40799#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {40799#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40799#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {40799#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40806#(and (= (+ main_~x~0 (- 4)) 4) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {40806#(and (= (+ main_~x~0 (- 4)) 4) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40806#(and (= (+ main_~x~0 (- 4)) 4) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {40806#(and (= (+ main_~x~0 (- 4)) 4) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40813#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 6)) 4))} is VALID [2022-04-28 09:19:38,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {40813#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 6)) 4))} assume !!(~x~0 % 4294967296 < 99); {40813#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 6)) 4))} is VALID [2022-04-28 09:19:38,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {40813#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 6)) 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40820#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {40820#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40820#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {40820#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40827#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {40827#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40827#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {40827#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40834#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} is VALID [2022-04-28 09:19:38,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {40834#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} assume !!(~x~0 % 4294967296 < 99); {40834#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} is VALID [2022-04-28 09:19:38,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {40834#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40841#(and (<= (mod main_~y~0 2) 0) (= 12 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:19:38,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {40841#(and (<= (mod main_~y~0 2) 0) (= 12 (+ main_~x~0 (- 6))))} assume !!(~x~0 % 4294967296 < 99); {40841#(and (<= (mod main_~y~0 2) 0) (= 12 (+ main_~x~0 (- 6))))} is VALID [2022-04-28 09:19:38,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {40841#(and (<= (mod main_~y~0 2) 0) (= 12 (+ main_~x~0 (- 6))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40848#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {40848#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40848#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {40848#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40855#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {40855#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40855#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {40855#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40862#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {40862#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40862#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {40862#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40869#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:19:38,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {40869#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 99); {40869#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} is VALID [2022-04-28 09:19:38,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {40869#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40876#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {40876#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40876#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {40876#(and (= 26 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40883#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 26))} is VALID [2022-04-28 09:19:38,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {40883#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 26))} assume !!(~x~0 % 4294967296 < 99); {40883#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 26))} is VALID [2022-04-28 09:19:38,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {40883#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 26))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40890#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {40890#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40890#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {40890#(and (= 32 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40897#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {40897#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40897#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {40897#(and (= 32 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40904#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:19:38,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {40904#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume !!(~x~0 % 4294967296 < 99); {40904#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:19:38,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {40904#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40911#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {40911#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40911#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {40911#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40918#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,901 INFO L290 TraceCheckUtils]: 46: Hoare triple {40918#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40918#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {40918#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40925#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:19:38,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {40925#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {40925#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} is VALID [2022-04-28 09:19:38,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {40925#(and (<= (mod main_~y~0 2) 0) (= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40932#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {40932#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40932#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {40932#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40939#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:19:38,902 INFO L290 TraceCheckUtils]: 52: Hoare triple {40939#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {40939#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:19:38,903 INFO L290 TraceCheckUtils]: 53: Hoare triple {40939#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40946#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} is VALID [2022-04-28 09:19:38,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {40946#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} assume !!(~x~0 % 4294967296 < 99); {40946#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} is VALID [2022-04-28 09:19:38,903 INFO L290 TraceCheckUtils]: 55: Hoare triple {40946#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40953#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,903 INFO L290 TraceCheckUtils]: 56: Hoare triple {40953#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40953#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,903 INFO L290 TraceCheckUtils]: 57: Hoare triple {40953#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40960#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {40960#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40960#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,904 INFO L290 TraceCheckUtils]: 59: Hoare triple {40960#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40967#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,904 INFO L290 TraceCheckUtils]: 60: Hoare triple {40967#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40967#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,904 INFO L290 TraceCheckUtils]: 61: Hoare triple {40967#(and (= main_~x~0 54) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40974#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,905 INFO L290 TraceCheckUtils]: 62: Hoare triple {40974#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40974#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,905 INFO L290 TraceCheckUtils]: 63: Hoare triple {40974#(and (= (+ (- 2) main_~x~0) 54) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40981#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,905 INFO L290 TraceCheckUtils]: 64: Hoare triple {40981#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40981#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {40981#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40988#(and (= 58 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,906 INFO L290 TraceCheckUtils]: 66: Hoare triple {40988#(and (= 58 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {40988#(and (= 58 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,906 INFO L290 TraceCheckUtils]: 67: Hoare triple {40988#(and (= 58 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {40995#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 58))} is VALID [2022-04-28 09:19:38,906 INFO L290 TraceCheckUtils]: 68: Hoare triple {40995#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 58))} assume !!(~x~0 % 4294967296 < 99); {40995#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 58))} is VALID [2022-04-28 09:19:38,907 INFO L290 TraceCheckUtils]: 69: Hoare triple {40995#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41002#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} is VALID [2022-04-28 09:19:38,907 INFO L290 TraceCheckUtils]: 70: Hoare triple {41002#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {41002#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} is VALID [2022-04-28 09:19:38,907 INFO L290 TraceCheckUtils]: 71: Hoare triple {41002#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41009#(and (<= (mod main_~y~0 2) 0) (= 66 main_~x~0))} is VALID [2022-04-28 09:19:38,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {41009#(and (<= (mod main_~y~0 2) 0) (= 66 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {41009#(and (<= (mod main_~y~0 2) 0) (= 66 main_~x~0))} is VALID [2022-04-28 09:19:38,908 INFO L290 TraceCheckUtils]: 73: Hoare triple {41009#(and (<= (mod main_~y~0 2) 0) (= 66 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41016#(and (= 66 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,908 INFO L290 TraceCheckUtils]: 74: Hoare triple {41016#(and (= 66 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {41016#(and (= 66 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,908 INFO L290 TraceCheckUtils]: 75: Hoare triple {41016#(and (= 66 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41023#(and (= 66 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,908 INFO L290 TraceCheckUtils]: 76: Hoare triple {41023#(and (= 66 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {41023#(and (= 66 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,909 INFO L290 TraceCheckUtils]: 77: Hoare triple {41023#(and (= 66 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41030#(and (= 72 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,909 INFO L290 TraceCheckUtils]: 78: Hoare triple {41030#(and (= 72 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {41030#(and (= 72 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,909 INFO L290 TraceCheckUtils]: 79: Hoare triple {41030#(and (= 72 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41037#(and (= main_~x~0 74) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,909 INFO L290 TraceCheckUtils]: 80: Hoare triple {41037#(and (= main_~x~0 74) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {41037#(and (= main_~x~0 74) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,910 INFO L290 TraceCheckUtils]: 81: Hoare triple {41037#(and (= main_~x~0 74) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41044#(and (<= (mod main_~y~0 2) 0) (= 74 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:19:38,910 INFO L290 TraceCheckUtils]: 82: Hoare triple {41044#(and (<= (mod main_~y~0 2) 0) (= 74 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {41044#(and (<= (mod main_~y~0 2) 0) (= 74 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:19:38,910 INFO L290 TraceCheckUtils]: 83: Hoare triple {41044#(and (<= (mod main_~y~0 2) 0) (= 74 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41051#(and (= main_~x~0 78) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,910 INFO L290 TraceCheckUtils]: 84: Hoare triple {41051#(and (= main_~x~0 78) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {41051#(and (= main_~x~0 78) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,911 INFO L290 TraceCheckUtils]: 85: Hoare triple {41051#(and (= main_~x~0 78) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41058#(and (= 78 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,911 INFO L290 TraceCheckUtils]: 86: Hoare triple {41058#(and (= 78 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {41058#(and (= 78 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,911 INFO L290 TraceCheckUtils]: 87: Hoare triple {41058#(and (= 78 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41065#(and (= main_~x~0 82) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,911 INFO L290 TraceCheckUtils]: 88: Hoare triple {41065#(and (= main_~x~0 82) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {41065#(and (= main_~x~0 82) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,912 INFO L290 TraceCheckUtils]: 89: Hoare triple {41065#(and (= main_~x~0 82) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41072#(and (<= (mod main_~y~0 2) 0) (= 84 main_~x~0))} is VALID [2022-04-28 09:19:38,912 INFO L290 TraceCheckUtils]: 90: Hoare triple {41072#(and (<= (mod main_~y~0 2) 0) (= 84 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {41072#(and (<= (mod main_~y~0 2) 0) (= 84 main_~x~0))} is VALID [2022-04-28 09:19:38,912 INFO L290 TraceCheckUtils]: 91: Hoare triple {41072#(and (<= (mod main_~y~0 2) 0) (= 84 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41079#(and (= main_~x~0 86) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,912 INFO L290 TraceCheckUtils]: 92: Hoare triple {41079#(and (= main_~x~0 86) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {41079#(and (= main_~x~0 86) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,913 INFO L290 TraceCheckUtils]: 93: Hoare triple {41079#(and (= main_~x~0 86) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41086#(and (= 88 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,913 INFO L290 TraceCheckUtils]: 94: Hoare triple {41086#(and (= 88 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {41086#(and (= 88 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:38,913 INFO L290 TraceCheckUtils]: 95: Hoare triple {41086#(and (= 88 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41093#(and (<= (mod main_~y~0 2) 0) (= 88 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:19:38,913 INFO L290 TraceCheckUtils]: 96: Hoare triple {41093#(and (<= (mod main_~y~0 2) 0) (= 88 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {41093#(and (<= (mod main_~y~0 2) 0) (= 88 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:19:38,914 INFO L290 TraceCheckUtils]: 97: Hoare triple {41093#(and (<= (mod main_~y~0 2) 0) (= 88 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41100#(and (<= (mod main_~y~0 2) 0) (= 88 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:19:38,914 INFO L290 TraceCheckUtils]: 98: Hoare triple {41100#(and (<= (mod main_~y~0 2) 0) (= 88 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < 99); {41100#(and (<= (mod main_~y~0 2) 0) (= 88 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:19:38,914 INFO L290 TraceCheckUtils]: 99: Hoare triple {41100#(and (<= (mod main_~y~0 2) 0) (= 88 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41107#(and (<= (mod main_~y~0 2) 0) (= 94 main_~x~0))} is VALID [2022-04-28 09:19:38,914 INFO L290 TraceCheckUtils]: 100: Hoare triple {41107#(and (<= (mod main_~y~0 2) 0) (= 94 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {41107#(and (<= (mod main_~y~0 2) 0) (= 94 main_~x~0))} is VALID [2022-04-28 09:19:38,915 INFO L272 TraceCheckUtils]: 101: Hoare triple {41107#(and (<= (mod main_~y~0 2) 0) (= 94 main_~x~0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {41114#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:19:38,915 INFO L290 TraceCheckUtils]: 102: Hoare triple {41114#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {41118#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:19:38,915 INFO L290 TraceCheckUtils]: 103: Hoare triple {41118#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40708#false} is VALID [2022-04-28 09:19:38,915 INFO L290 TraceCheckUtils]: 104: Hoare triple {40708#false} assume !false; {40708#false} is VALID [2022-04-28 09:19:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:38,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:19:39,387 INFO L290 TraceCheckUtils]: 104: Hoare triple {40708#false} assume !false; {40708#false} is VALID [2022-04-28 09:19:39,387 INFO L290 TraceCheckUtils]: 103: Hoare triple {41118#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40708#false} is VALID [2022-04-28 09:19:39,388 INFO L290 TraceCheckUtils]: 102: Hoare triple {41114#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {41118#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:19:39,388 INFO L272 TraceCheckUtils]: 101: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {41114#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:19:39,389 INFO L290 TraceCheckUtils]: 100: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,389 INFO L290 TraceCheckUtils]: 99: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,389 INFO L290 TraceCheckUtils]: 98: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,390 INFO L290 TraceCheckUtils]: 97: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,390 INFO L290 TraceCheckUtils]: 96: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,391 INFO L290 TraceCheckUtils]: 95: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,391 INFO L290 TraceCheckUtils]: 94: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,391 INFO L290 TraceCheckUtils]: 93: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,392 INFO L290 TraceCheckUtils]: 92: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,392 INFO L290 TraceCheckUtils]: 91: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,393 INFO L290 TraceCheckUtils]: 90: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,393 INFO L290 TraceCheckUtils]: 89: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,393 INFO L290 TraceCheckUtils]: 88: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,394 INFO L290 TraceCheckUtils]: 87: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,394 INFO L290 TraceCheckUtils]: 86: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,395 INFO L290 TraceCheckUtils]: 85: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,395 INFO L290 TraceCheckUtils]: 84: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,395 INFO L290 TraceCheckUtils]: 83: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,396 INFO L290 TraceCheckUtils]: 82: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,396 INFO L290 TraceCheckUtils]: 81: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,396 INFO L290 TraceCheckUtils]: 80: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,397 INFO L290 TraceCheckUtils]: 79: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,397 INFO L290 TraceCheckUtils]: 78: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,398 INFO L290 TraceCheckUtils]: 77: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,398 INFO L290 TraceCheckUtils]: 76: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,399 INFO L290 TraceCheckUtils]: 75: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,399 INFO L290 TraceCheckUtils]: 74: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,399 INFO L290 TraceCheckUtils]: 73: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,400 INFO L290 TraceCheckUtils]: 72: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,400 INFO L290 TraceCheckUtils]: 71: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,400 INFO L290 TraceCheckUtils]: 70: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,402 INFO L290 TraceCheckUtils]: 67: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,402 INFO L290 TraceCheckUtils]: 66: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,402 INFO L290 TraceCheckUtils]: 65: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,403 INFO L290 TraceCheckUtils]: 64: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,403 INFO L290 TraceCheckUtils]: 63: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,404 INFO L290 TraceCheckUtils]: 62: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,404 INFO L290 TraceCheckUtils]: 61: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,404 INFO L290 TraceCheckUtils]: 60: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,405 INFO L290 TraceCheckUtils]: 59: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,408 INFO L290 TraceCheckUtils]: 51: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,408 INFO L290 TraceCheckUtils]: 50: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,409 INFO L290 TraceCheckUtils]: 49: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,409 INFO L290 TraceCheckUtils]: 48: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,409 INFO L290 TraceCheckUtils]: 47: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,413 INFO L290 TraceCheckUtils]: 39: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {41417#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {41134#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:39,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {41417#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {41417#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:19:39,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {40707#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {41417#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-28 09:19:39,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {40707#true} call #t~ret6 := main(); {40707#true} is VALID [2022-04-28 09:19:39,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40707#true} {40707#true} #42#return; {40707#true} is VALID [2022-04-28 09:19:39,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {40707#true} assume true; {40707#true} is VALID [2022-04-28 09:19:39,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {40707#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(14, 2);call #Ultimate.allocInit(12, 3); {40707#true} is VALID [2022-04-28 09:19:39,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {40707#true} call ULTIMATE.init(); {40707#true} is VALID [2022-04-28 09:19:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 2116 trivial. 0 not checked. [2022-04-28 09:19:39,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034457265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:19:39,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:19:39,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 52, 6] total 102 [2022-04-28 09:19:39,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:19:39,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [412218144] [2022-04-28 09:19:39,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [412218144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:19:39,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:19:39,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 09:19:39,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399268594] [2022-04-28 09:19:39,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:19:39,427 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 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 105 [2022-04-28 09:19:39,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:19:39,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:39,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:39,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 09:19:39,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:39,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 09:19:39,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=9820, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 09:19:39,501 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:46,073 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-04-28 09:19:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 09:19:46,073 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 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 105 [2022-04-28 09:19:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:19:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 114 transitions. [2022-04-28 09:19:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 114 transitions. [2022-04-28 09:19:46,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 114 transitions. [2022-04-28 09:19:46,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:46,139 INFO L225 Difference]: With dead ends: 114 [2022-04-28 09:19:46,139 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 09:19:46,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4750 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=815, Invalid=21535, Unknown=0, NotChecked=0, Total=22350 [2022-04-28 09:19:46,140 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 103 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4528 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 4625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 4528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 09:19:46,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 73 Invalid, 4625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 4528 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 09:19:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 09:19:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2022-04-28 09:19:46,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:19:46,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 108 states, 103 states have (on average 1.0097087378640777) internal successors, (104), 103 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:46,517 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 108 states, 103 states have (on average 1.0097087378640777) internal successors, (104), 103 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:46,518 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 108 states, 103 states have (on average 1.0097087378640777) internal successors, (104), 103 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:46,518 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2022-04-28 09:19:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2022-04-28 09:19:46,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:19:46,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:19:46,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.0097087378640777) internal successors, (104), 103 states have internal predecessors, (104), 3 states have call successors, (3), 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 109 states. [2022-04-28 09:19:46,539 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.0097087378640777) internal successors, (104), 103 states have internal predecessors, (104), 3 states have call successors, (3), 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 109 states. [2022-04-28 09:19:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:19:46,540 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2022-04-28 09:19:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2022-04-28 09:19:46,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:19:46,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:19:46,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:19:46,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:19:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.0097087378640777) internal successors, (104), 103 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2022-04-28 09:19:46,543 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2022-04-28 09:19:46,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:19:46,544 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2022-04-28 09:19:46,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:46,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 108 transitions. [2022-04-28 09:19:46,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2022-04-28 09:19:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 09:19:46,691 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:19:46,691 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:19:46,707 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 09:19:46,903 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,SelfDestructingSolverStorable56 [2022-04-28 09:19:46,903 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:19:46,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:19:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1607845288, now seen corresponding path program 95 times [2022-04-28 09:19:46,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:46,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010090582] [2022-04-28 09:19:46,907 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:19:46,908 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:19:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1607845288, now seen corresponding path program 96 times [2022-04-28 09:19:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:19:46,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626436025] [2022-04-28 09:19:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:19:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:19:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:48,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:19:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:48,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {42253#(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(14, 2);call #Ultimate.allocInit(12, 3); {42199#true} is VALID [2022-04-28 09:19:48,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {42199#true} assume true; {42199#true} is VALID [2022-04-28 09:19:48,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42199#true} {42199#true} #42#return; {42199#true} is VALID [2022-04-28 09:19:48,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {42199#true} call ULTIMATE.init(); {42253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:19:48,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {42253#(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(14, 2);call #Ultimate.allocInit(12, 3); {42199#true} is VALID [2022-04-28 09:19:48,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {42199#true} assume true; {42199#true} is VALID [2022-04-28 09:19:48,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42199#true} {42199#true} #42#return; {42199#true} is VALID [2022-04-28 09:19:48,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {42199#true} call #t~ret6 := main(); {42199#true} is VALID [2022-04-28 09:19:48,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {42199#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {42204#(= main_~x~0 0)} is VALID [2022-04-28 09:19:48,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {42204#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {42204#(= main_~x~0 0)} is VALID [2022-04-28 09:19:48,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {42204#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:48,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {42205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {42205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:48,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {42205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42206#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:48,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {42206#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42206#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:48,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {42206#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42207#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:48,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {42207#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {42207#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:48,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {42207#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42208#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:48,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {42208#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42208#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:48,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {42208#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42209#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:48,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {42209#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42209#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:48,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {42209#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42210#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:48,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {42210#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42210#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:48,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {42210#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42211#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:48,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {42211#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {42211#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:48,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {42211#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42212#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:48,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {42212#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42212#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:48,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {42212#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:48,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {42213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:48,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {42213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42214#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:48,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {42214#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42214#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:48,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {42214#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42215#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:48,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {42215#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {42215#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:48,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {42215#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42216#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:48,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {42216#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42216#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:48,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {42216#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42217#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:48,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {42217#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42217#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:48,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {42217#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42218#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:48,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {42218#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {42218#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:48,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {42218#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42219#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:48,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {42219#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {42219#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:48,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {42219#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42220#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:48,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {42220#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42220#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:48,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {42220#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42221#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:48,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {42221#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42221#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:48,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {42221#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42222#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:48,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {42222#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42222#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:48,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {42222#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42223#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:48,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {42223#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42223#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:48,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {42223#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42224#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:48,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {42224#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42224#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:48,134 INFO L290 TraceCheckUtils]: 47: Hoare triple {42224#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42225#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:48,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {42225#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42225#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:48,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {42225#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42226#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:48,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {42226#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {42226#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:48,135 INFO L290 TraceCheckUtils]: 51: Hoare triple {42226#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42227#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:48,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {42227#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {42227#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:48,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {42227#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42228#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:48,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {42228#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42228#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:48,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {42228#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42229#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:19:48,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {42229#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42229#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:19:48,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {42229#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42230#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:19:48,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {42230#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42230#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:19:48,139 INFO L290 TraceCheckUtils]: 59: Hoare triple {42230#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42231#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:48,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {42231#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42231#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:48,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {42231#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42232#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:48,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {42232#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42232#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:48,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {42232#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42233#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:48,140 INFO L290 TraceCheckUtils]: 64: Hoare triple {42233#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {42233#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:48,141 INFO L290 TraceCheckUtils]: 65: Hoare triple {42233#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42234#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:19:48,141 INFO L290 TraceCheckUtils]: 66: Hoare triple {42234#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42234#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:19:48,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {42234#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42235#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:48,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {42235#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {42235#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:48,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {42235#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42236#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:19:48,143 INFO L290 TraceCheckUtils]: 70: Hoare triple {42236#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42236#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:19:48,143 INFO L290 TraceCheckUtils]: 71: Hoare triple {42236#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42237#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:48,144 INFO L290 TraceCheckUtils]: 72: Hoare triple {42237#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {42237#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:48,144 INFO L290 TraceCheckUtils]: 73: Hoare triple {42237#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42238#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:19:48,144 INFO L290 TraceCheckUtils]: 74: Hoare triple {42238#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42238#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:19:48,145 INFO L290 TraceCheckUtils]: 75: Hoare triple {42238#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42239#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:48,145 INFO L290 TraceCheckUtils]: 76: Hoare triple {42239#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42239#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:48,146 INFO L290 TraceCheckUtils]: 77: Hoare triple {42239#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42240#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:48,146 INFO L290 TraceCheckUtils]: 78: Hoare triple {42240#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {42240#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:48,146 INFO L290 TraceCheckUtils]: 79: Hoare triple {42240#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42241#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:48,147 INFO L290 TraceCheckUtils]: 80: Hoare triple {42241#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {42241#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:48,147 INFO L290 TraceCheckUtils]: 81: Hoare triple {42241#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42242#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:19:48,147 INFO L290 TraceCheckUtils]: 82: Hoare triple {42242#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {42242#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:19:48,148 INFO L290 TraceCheckUtils]: 83: Hoare triple {42242#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42243#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:48,148 INFO L290 TraceCheckUtils]: 84: Hoare triple {42243#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {42243#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:48,149 INFO L290 TraceCheckUtils]: 85: Hoare triple {42243#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42244#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:48,149 INFO L290 TraceCheckUtils]: 86: Hoare triple {42244#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {42244#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:48,149 INFO L290 TraceCheckUtils]: 87: Hoare triple {42244#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42245#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:19:48,150 INFO L290 TraceCheckUtils]: 88: Hoare triple {42245#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {42245#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:19:48,150 INFO L290 TraceCheckUtils]: 89: Hoare triple {42245#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42246#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:19:48,150 INFO L290 TraceCheckUtils]: 90: Hoare triple {42246#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 99); {42246#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:19:48,151 INFO L290 TraceCheckUtils]: 91: Hoare triple {42246#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42247#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:19:48,151 INFO L290 TraceCheckUtils]: 92: Hoare triple {42247#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42247#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:19:48,152 INFO L290 TraceCheckUtils]: 93: Hoare triple {42247#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42248#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:48,152 INFO L290 TraceCheckUtils]: 94: Hoare triple {42248#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42248#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:48,152 INFO L290 TraceCheckUtils]: 95: Hoare triple {42248#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42249#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 09:19:48,153 INFO L290 TraceCheckUtils]: 96: Hoare triple {42249#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 99); {42249#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 09:19:48,153 INFO L290 TraceCheckUtils]: 97: Hoare triple {42249#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42250#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 09:19:48,154 INFO L290 TraceCheckUtils]: 98: Hoare triple {42250#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42250#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 09:19:48,154 INFO L290 TraceCheckUtils]: 99: Hoare triple {42250#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42251#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 09:19:48,154 INFO L290 TraceCheckUtils]: 100: Hoare triple {42251#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 99); {42251#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 09:19:48,155 INFO L290 TraceCheckUtils]: 101: Hoare triple {42251#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42252#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 96))} is VALID [2022-04-28 09:19:48,155 INFO L290 TraceCheckUtils]: 102: Hoare triple {42252#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 96))} assume !(~x~0 % 4294967296 < 99); {42200#false} is VALID [2022-04-28 09:19:48,155 INFO L272 TraceCheckUtils]: 103: Hoare triple {42200#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {42200#false} is VALID [2022-04-28 09:19:48,155 INFO L290 TraceCheckUtils]: 104: Hoare triple {42200#false} ~cond := #in~cond; {42200#false} is VALID [2022-04-28 09:19:48,156 INFO L290 TraceCheckUtils]: 105: Hoare triple {42200#false} assume 0 == ~cond; {42200#false} is VALID [2022-04-28 09:19:48,156 INFO L290 TraceCheckUtils]: 106: Hoare triple {42200#false} assume !false; {42200#false} is VALID [2022-04-28 09:19:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:48,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:19:48,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626436025] [2022-04-28 09:19:48,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626436025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:19:48,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092877488] [2022-04-28 09:19:48,156 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:19:48,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:19:48,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:19:48,157 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 09:19:48,172 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 09:19:52,303 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2022-04-28 09:19:52,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:19:52,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 103 conjunts are in the unsatisfiable core [2022-04-28 09:19:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:19:52,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:19:54,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {42199#true} call ULTIMATE.init(); {42199#true} is VALID [2022-04-28 09:19:54,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {42199#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(14, 2);call #Ultimate.allocInit(12, 3); {42199#true} is VALID [2022-04-28 09:19:54,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {42199#true} assume true; {42199#true} is VALID [2022-04-28 09:19:54,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42199#true} {42199#true} #42#return; {42199#true} is VALID [2022-04-28 09:19:54,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {42199#true} call #t~ret6 := main(); {42199#true} is VALID [2022-04-28 09:19:54,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {42199#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {42204#(= main_~x~0 0)} is VALID [2022-04-28 09:19:54,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {42204#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {42204#(= main_~x~0 0)} is VALID [2022-04-28 09:19:54,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {42204#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:54,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {42205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {42205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:19:54,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {42205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42206#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:54,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {42206#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42206#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:19:54,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {42206#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42207#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:54,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {42207#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {42207#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:19:54,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {42207#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42208#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:54,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {42208#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42208#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:19:54,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {42208#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42209#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:54,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {42209#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42209#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:19:54,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {42209#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42210#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:54,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {42210#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42210#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:19:54,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {42210#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42211#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:54,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {42211#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {42211#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:19:54,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {42211#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42212#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:54,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {42212#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42212#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:19:54,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {42212#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:54,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {42213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:19:54,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {42213#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42214#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:54,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {42214#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42214#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:19:54,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {42214#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42215#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:54,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {42215#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {42215#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:19:54,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {42215#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42216#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:54,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {42216#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42216#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:19:54,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {42216#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42217#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:54,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {42217#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42217#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:19:54,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {42217#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42218#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:54,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {42218#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {42218#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:19:54,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {42218#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42219#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:54,378 INFO L290 TraceCheckUtils]: 36: Hoare triple {42219#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {42219#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:19:54,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {42219#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42220#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:54,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {42220#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42220#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:19:54,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {42220#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42221#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:54,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {42221#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42221#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:19:54,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {42221#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42222#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:54,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {42222#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42222#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:19:54,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {42222#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42223#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:54,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {42223#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42223#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:19:54,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {42223#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42224#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:54,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {42224#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42224#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:19:54,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {42224#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42225#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:54,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {42225#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42225#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:19:54,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {42225#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42226#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:54,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {42226#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {42226#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:19:54,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {42226#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42227#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:54,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {42227#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {42227#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:19:54,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {42227#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42416#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:54,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {42416#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42416#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} is VALID [2022-04-28 09:19:54,385 INFO L290 TraceCheckUtils]: 55: Hoare triple {42416#(and (<= main_~x~0 48) (<= (mod main_~y~0 2) 0) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42423#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,386 INFO L290 TraceCheckUtils]: 56: Hoare triple {42423#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42423#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {42423#(and (<= main_~x~0 50) (<= 50 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42430#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,386 INFO L290 TraceCheckUtils]: 58: Hoare triple {42430#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42430#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,387 INFO L290 TraceCheckUtils]: 59: Hoare triple {42430#(and (<= main_~x~0 52) (<= 52 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42437#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:54,387 INFO L290 TraceCheckUtils]: 60: Hoare triple {42437#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42437#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} is VALID [2022-04-28 09:19:54,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {42437#(and (<= main_~x~0 54) (<= (mod main_~y~0 2) 0) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42444#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:54,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {42444#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42444#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:19:54,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {42444#(and (<= (mod main_~y~0 2) 0) (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42451#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:54,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {42451#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {42451#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} is VALID [2022-04-28 09:19:54,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {42451#(and (<= 58 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42458#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,390 INFO L290 TraceCheckUtils]: 66: Hoare triple {42458#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42458#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,390 INFO L290 TraceCheckUtils]: 67: Hoare triple {42458#(and (<= main_~x~0 60) (<= 60 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42465#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:54,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {42465#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {42465#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} is VALID [2022-04-28 09:19:54,391 INFO L290 TraceCheckUtils]: 69: Hoare triple {42465#(and (<= 62 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42472#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {42472#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42472#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,392 INFO L290 TraceCheckUtils]: 71: Hoare triple {42472#(and (<= main_~x~0 64) (<= 64 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42479#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:54,392 INFO L290 TraceCheckUtils]: 72: Hoare triple {42479#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {42479#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} is VALID [2022-04-28 09:19:54,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {42479#(and (<= 66 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42486#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {42486#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42486#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,394 INFO L290 TraceCheckUtils]: 75: Hoare triple {42486#(and (<= main_~x~0 68) (<= 68 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42493#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:54,394 INFO L290 TraceCheckUtils]: 76: Hoare triple {42493#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42493#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} is VALID [2022-04-28 09:19:54,395 INFO L290 TraceCheckUtils]: 77: Hoare triple {42493#(and (<= main_~x~0 70) (<= (mod main_~y~0 2) 0) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42500#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:54,395 INFO L290 TraceCheckUtils]: 78: Hoare triple {42500#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {42500#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} is VALID [2022-04-28 09:19:54,395 INFO L290 TraceCheckUtils]: 79: Hoare triple {42500#(and (<= 72 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42507#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:54,396 INFO L290 TraceCheckUtils]: 80: Hoare triple {42507#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {42507#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} is VALID [2022-04-28 09:19:54,396 INFO L290 TraceCheckUtils]: 81: Hoare triple {42507#(and (<= 74 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42514#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,397 INFO L290 TraceCheckUtils]: 82: Hoare triple {42514#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42514#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,397 INFO L290 TraceCheckUtils]: 83: Hoare triple {42514#(and (<= 76 main_~x~0) (<= main_~x~0 76) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42521#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:54,397 INFO L290 TraceCheckUtils]: 84: Hoare triple {42521#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {42521#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} is VALID [2022-04-28 09:19:54,398 INFO L290 TraceCheckUtils]: 85: Hoare triple {42521#(and (<= 78 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42528#(and (<= 80 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:54,398 INFO L290 TraceCheckUtils]: 86: Hoare triple {42528#(and (<= 80 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {42528#(and (<= 80 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 80))} is VALID [2022-04-28 09:19:54,399 INFO L290 TraceCheckUtils]: 87: Hoare triple {42528#(and (<= 80 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42535#(and (<= 82 main_~x~0) (<= main_~x~0 82) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,399 INFO L290 TraceCheckUtils]: 88: Hoare triple {42535#(and (<= 82 main_~x~0) (<= main_~x~0 82) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42535#(and (<= 82 main_~x~0) (<= main_~x~0 82) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,400 INFO L290 TraceCheckUtils]: 89: Hoare triple {42535#(and (<= 82 main_~x~0) (<= main_~x~0 82) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42542#(and (<= 84 main_~x~0) (<= main_~x~0 84) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,400 INFO L290 TraceCheckUtils]: 90: Hoare triple {42542#(and (<= 84 main_~x~0) (<= main_~x~0 84) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42542#(and (<= 84 main_~x~0) (<= main_~x~0 84) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,400 INFO L290 TraceCheckUtils]: 91: Hoare triple {42542#(and (<= 84 main_~x~0) (<= main_~x~0 84) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42549#(and (<= main_~x~0 86) (<= 86 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,401 INFO L290 TraceCheckUtils]: 92: Hoare triple {42549#(and (<= main_~x~0 86) (<= 86 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42549#(and (<= main_~x~0 86) (<= 86 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,401 INFO L290 TraceCheckUtils]: 93: Hoare triple {42549#(and (<= main_~x~0 86) (<= 86 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42556#(and (<= main_~x~0 88) (<= (mod main_~y~0 2) 0) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:54,402 INFO L290 TraceCheckUtils]: 94: Hoare triple {42556#(and (<= main_~x~0 88) (<= (mod main_~y~0 2) 0) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {42556#(and (<= main_~x~0 88) (<= (mod main_~y~0 2) 0) (<= 88 main_~x~0))} is VALID [2022-04-28 09:19:54,402 INFO L290 TraceCheckUtils]: 95: Hoare triple {42556#(and (<= main_~x~0 88) (<= (mod main_~y~0 2) 0) (<= 88 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42563#(and (<= 90 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 90))} is VALID [2022-04-28 09:19:54,402 INFO L290 TraceCheckUtils]: 96: Hoare triple {42563#(and (<= 90 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 99); {42563#(and (<= 90 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 90))} is VALID [2022-04-28 09:19:54,403 INFO L290 TraceCheckUtils]: 97: Hoare triple {42563#(and (<= 90 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 90))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42570#(and (<= main_~x~0 92) (<= 92 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,403 INFO L290 TraceCheckUtils]: 98: Hoare triple {42570#(and (<= main_~x~0 92) (<= 92 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42570#(and (<= main_~x~0 92) (<= 92 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:19:54,404 INFO L290 TraceCheckUtils]: 99: Hoare triple {42570#(and (<= main_~x~0 92) (<= 92 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42577#(and (<= 94 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 94))} is VALID [2022-04-28 09:19:54,404 INFO L290 TraceCheckUtils]: 100: Hoare triple {42577#(and (<= 94 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 99); {42577#(and (<= 94 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 94))} is VALID [2022-04-28 09:19:54,405 INFO L290 TraceCheckUtils]: 101: Hoare triple {42577#(and (<= 94 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 94))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42584#(and (<= 96 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 96))} is VALID [2022-04-28 09:19:54,405 INFO L290 TraceCheckUtils]: 102: Hoare triple {42584#(and (<= 96 main_~x~0) (<= (mod main_~y~0 2) 0) (<= main_~x~0 96))} assume !(~x~0 % 4294967296 < 99); {42200#false} is VALID [2022-04-28 09:19:54,405 INFO L272 TraceCheckUtils]: 103: Hoare triple {42200#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {42200#false} is VALID [2022-04-28 09:19:54,405 INFO L290 TraceCheckUtils]: 104: Hoare triple {42200#false} ~cond := #in~cond; {42200#false} is VALID [2022-04-28 09:19:54,405 INFO L290 TraceCheckUtils]: 105: Hoare triple {42200#false} assume 0 == ~cond; {42200#false} is VALID [2022-04-28 09:19:54,405 INFO L290 TraceCheckUtils]: 106: Hoare triple {42200#false} assume !false; {42200#false} is VALID [2022-04-28 09:19:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:54,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:19:59,124 INFO L290 TraceCheckUtils]: 106: Hoare triple {42200#false} assume !false; {42200#false} is VALID [2022-04-28 09:19:59,125 INFO L290 TraceCheckUtils]: 105: Hoare triple {42603#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {42200#false} is VALID [2022-04-28 09:19:59,125 INFO L290 TraceCheckUtils]: 104: Hoare triple {42607#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42603#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:19:59,126 INFO L272 TraceCheckUtils]: 103: Hoare triple {42611#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {42607#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:19:59,126 INFO L290 TraceCheckUtils]: 102: Hoare triple {42615#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !(~x~0 % 4294967296 < 99); {42611#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 09:19:59,131 INFO L290 TraceCheckUtils]: 101: Hoare triple {42619#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42615#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,131 INFO L290 TraceCheckUtils]: 100: Hoare triple {42619#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42619#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-28 09:19:59,132 INFO L290 TraceCheckUtils]: 99: Hoare triple {42626#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42619#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-28 09:19:59,133 INFO L290 TraceCheckUtils]: 98: Hoare triple {42626#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42626#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,133 INFO L290 TraceCheckUtils]: 97: Hoare triple {42633#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42626#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,134 INFO L290 TraceCheckUtils]: 96: Hoare triple {42633#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42633#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,134 INFO L290 TraceCheckUtils]: 95: Hoare triple {42640#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42633#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,135 INFO L290 TraceCheckUtils]: 94: Hoare triple {42640#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42640#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,135 INFO L290 TraceCheckUtils]: 93: Hoare triple {42647#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42640#(or (< (mod (+ main_~x~0 8) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,136 INFO L290 TraceCheckUtils]: 92: Hoare triple {42647#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42647#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-28 09:19:59,137 INFO L290 TraceCheckUtils]: 91: Hoare triple {42654#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42647#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 99))} is VALID [2022-04-28 09:19:59,137 INFO L290 TraceCheckUtils]: 90: Hoare triple {42654#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42654#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-28 09:19:59,140 INFO L290 TraceCheckUtils]: 89: Hoare triple {42661#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42654#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 99))} is VALID [2022-04-28 09:19:59,140 INFO L290 TraceCheckUtils]: 88: Hoare triple {42661#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42661#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-28 09:19:59,141 INFO L290 TraceCheckUtils]: 87: Hoare triple {42668#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42661#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 99))} is VALID [2022-04-28 09:19:59,141 INFO L290 TraceCheckUtils]: 86: Hoare triple {42668#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42668#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,142 INFO L290 TraceCheckUtils]: 85: Hoare triple {42675#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42668#(or (< (mod (+ main_~x~0 16) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,142 INFO L290 TraceCheckUtils]: 84: Hoare triple {42675#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42675#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-28 09:19:59,143 INFO L290 TraceCheckUtils]: 83: Hoare triple {42682#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42675#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 99))} is VALID [2022-04-28 09:19:59,143 INFO L290 TraceCheckUtils]: 82: Hoare triple {42682#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42682#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,144 INFO L290 TraceCheckUtils]: 81: Hoare triple {42689#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42682#(or (< (mod (+ main_~x~0 20) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,144 INFO L290 TraceCheckUtils]: 80: Hoare triple {42689#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42689#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,145 INFO L290 TraceCheckUtils]: 79: Hoare triple {42696#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42689#(or (< (mod (+ main_~x~0 22) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,146 INFO L290 TraceCheckUtils]: 78: Hoare triple {42696#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42696#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,146 INFO L290 TraceCheckUtils]: 77: Hoare triple {42703#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42696#(or (< (mod (+ main_~x~0 24) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,147 INFO L290 TraceCheckUtils]: 76: Hoare triple {42703#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42703#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,147 INFO L290 TraceCheckUtils]: 75: Hoare triple {42710#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42703#(or (< (mod (+ main_~x~0 26) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,148 INFO L290 TraceCheckUtils]: 74: Hoare triple {42710#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42710#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-28 09:19:59,148 INFO L290 TraceCheckUtils]: 73: Hoare triple {42717#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42710#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 99))} is VALID [2022-04-28 09:19:59,149 INFO L290 TraceCheckUtils]: 72: Hoare triple {42717#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42717#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,149 INFO L290 TraceCheckUtils]: 71: Hoare triple {42724#(or (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42717#(or (< (mod (+ 30 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,150 INFO L290 TraceCheckUtils]: 70: Hoare triple {42724#(or (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42724#(or (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,151 INFO L290 TraceCheckUtils]: 69: Hoare triple {42731#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42724#(or (< (mod (+ 32 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,151 INFO L290 TraceCheckUtils]: 68: Hoare triple {42731#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42731#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,152 INFO L290 TraceCheckUtils]: 67: Hoare triple {42738#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42731#(or (< (mod (+ main_~x~0 34) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,152 INFO L290 TraceCheckUtils]: 66: Hoare triple {42738#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42738#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,153 INFO L290 TraceCheckUtils]: 65: Hoare triple {42745#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42738#(or (< (mod (+ main_~x~0 36) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,153 INFO L290 TraceCheckUtils]: 64: Hoare triple {42745#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42745#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,154 INFO L290 TraceCheckUtils]: 63: Hoare triple {42752#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42745#(or (< (mod (+ main_~x~0 38) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,154 INFO L290 TraceCheckUtils]: 62: Hoare triple {42752#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42752#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,155 INFO L290 TraceCheckUtils]: 61: Hoare triple {42759#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42752#(or (< (mod (+ 40 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,155 INFO L290 TraceCheckUtils]: 60: Hoare triple {42759#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42759#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {42766#(or (< (mod (+ 44 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42759#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {42766#(or (< (mod (+ 44 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42766#(or (< (mod (+ 44 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,157 INFO L290 TraceCheckUtils]: 57: Hoare triple {42773#(or (< (mod (+ main_~x~0 46) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42766#(or (< (mod (+ 44 main_~x~0) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {42773#(or (< (mod (+ main_~x~0 46) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42773#(or (< (mod (+ main_~x~0 46) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {42780#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42773#(or (< (mod (+ main_~x~0 46) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,159 INFO L290 TraceCheckUtils]: 54: Hoare triple {42780#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !!(~x~0 % 4294967296 < 99); {42780#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {42787#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42780#(or (< (mod (+ main_~x~0 48) 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 09:19:59,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {42787#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42787#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99))} is VALID [2022-04-28 09:19:59,160 INFO L290 TraceCheckUtils]: 51: Hoare triple {42794#(or (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42787#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 50) 4294967296) 99))} is VALID [2022-04-28 09:19:59,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {42794#(or (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42794#(or (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {42801#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42794#(or (< (mod (+ main_~x~0 52) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {42801#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42801#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {42808#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42801#(or (< (mod (+ main_~x~0 54) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,163 INFO L290 TraceCheckUtils]: 46: Hoare triple {42808#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42808#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {42815#(or (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42808#(or (< (mod (+ 56 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,164 INFO L290 TraceCheckUtils]: 44: Hoare triple {42815#(or (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42815#(or (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {42822#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42815#(or (< (mod (+ main_~x~0 58) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {42822#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42822#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {42829#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42822#(or (< (mod (+ main_~x~0 60) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {42829#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42829#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} is VALID [2022-04-28 09:19:59,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {42836#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42829#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 62) 4294967296) 99))} is VALID [2022-04-28 09:19:59,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {42836#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42836#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {42843#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 66 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42836#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 64 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {42843#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 66 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42843#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 66 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {42850#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42843#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 66 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {42850#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42850#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {42857#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 70) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42850#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 68 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {42857#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 70) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42857#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 70) 4294967296) 99))} is VALID [2022-04-28 09:19:59,173 INFO L290 TraceCheckUtils]: 31: Hoare triple {42864#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42857#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 70) 4294967296) 99))} is VALID [2022-04-28 09:19:59,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {42864#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42864#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {42871#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 74) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42864#(or (< (mod (+ 72 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {42871#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 74) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42871#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 74) 4294967296) 99))} is VALID [2022-04-28 09:19:59,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {42878#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42871#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 74) 4294967296) 99))} is VALID [2022-04-28 09:19:59,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {42878#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42878#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {42885#(or (< (mod (+ main_~x~0 78) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42878#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 76 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {42885#(or (< (mod (+ main_~x~0 78) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42885#(or (< (mod (+ main_~x~0 78) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {42892#(or (< (mod (+ main_~x~0 80) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42885#(or (< (mod (+ main_~x~0 78) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {42892#(or (< (mod (+ main_~x~0 80) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42892#(or (< (mod (+ main_~x~0 80) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {42899#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 82) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42892#(or (< (mod (+ main_~x~0 80) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {42899#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 82) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42899#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 82) 4294967296) 99))} is VALID [2022-04-28 09:19:59,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {42906#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 84 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42899#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 82) 4294967296) 99))} is VALID [2022-04-28 09:19:59,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {42906#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 84 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42906#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 84 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {42913#(or (< (mod (+ main_~x~0 86) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42906#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 84 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {42913#(or (< (mod (+ main_~x~0 86) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42913#(or (< (mod (+ main_~x~0 86) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {42920#(or (< (mod (+ 88 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42913#(or (< (mod (+ main_~x~0 86) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {42920#(or (< (mod (+ 88 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42920#(or (< (mod (+ 88 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {42927#(or (< (mod (+ main_~x~0 90) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42920#(or (< (mod (+ 88 main_~x~0) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {42927#(or (< (mod (+ main_~x~0 90) 4294967296) 99) (<= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {42927#(or (< (mod (+ main_~x~0 90) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {42934#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 92 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42927#(or (< (mod (+ main_~x~0 90) 4294967296) 99) (<= (mod main_~x~0 2) 0))} is VALID [2022-04-28 09:19:59,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {42934#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 92 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42934#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 92 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {42941#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 94 main_~x~0) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42934#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 92 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {42941#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 94 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42941#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 94 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {42948#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 96) 4294967296) 99))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {42941#(or (<= (mod main_~x~0 2) 0) (< (mod (+ 94 main_~x~0) 4294967296) 99))} is VALID [2022-04-28 09:19:59,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {42948#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 96) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {42948#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 96) 4294967296) 99))} is VALID [2022-04-28 09:19:59,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {42199#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {42948#(or (<= (mod main_~x~0 2) 0) (< (mod (+ main_~x~0 96) 4294967296) 99))} is VALID [2022-04-28 09:19:59,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {42199#true} call #t~ret6 := main(); {42199#true} is VALID [2022-04-28 09:19:59,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42199#true} {42199#true} #42#return; {42199#true} is VALID [2022-04-28 09:19:59,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {42199#true} assume true; {42199#true} is VALID [2022-04-28 09:19:59,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {42199#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(14, 2);call #Ultimate.allocInit(12, 3); {42199#true} is VALID [2022-04-28 09:19:59,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {42199#true} call ULTIMATE.init(); {42199#true} is VALID [2022-04-28 09:19:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:19:59,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092877488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:19:59,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:19:59,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 54] total 129 [2022-04-28 09:19:59,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:19:59,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010090582] [2022-04-28 09:19:59,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010090582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:19:59,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:19:59,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 09:19:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693755315] [2022-04-28 09:19:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:19:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 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 107 [2022-04-28 09:19:59,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:19:59,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:19:59,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:19:59,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 09:19:59,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:19:59,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 09:19:59,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3728, Invalid=12784, Unknown=0, NotChecked=0, Total=16512 [2022-04-28 09:19:59,246 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:05,946 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2022-04-28 09:20:05,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 09:20:05,946 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 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 107 [2022-04-28 09:20:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:20:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 116 transitions. [2022-04-28 09:20:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 116 transitions. [2022-04-28 09:20:05,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 116 transitions. [2022-04-28 09:20:06,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:20:06,037 INFO L225 Difference]: With dead ends: 116 [2022-04-28 09:20:06,037 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 09:20:06,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5829 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=6121, Invalid=25385, Unknown=0, NotChecked=0, Total=31506 [2022-04-28 09:20:06,039 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 105 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4769 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 4769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 09:20:06,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 123 Invalid, 4868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 4769 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 09:20:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 09:20:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2022-04-28 09:20:06,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:20:06,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 110 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 105 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:06,681 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 110 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 105 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:06,681 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 110 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 105 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:06,682 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2022-04-28 09:20:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2022-04-28 09:20:06,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:20:06,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:20:06,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 105 states have internal predecessors, (106), 3 states have call successors, (3), 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 111 states. [2022-04-28 09:20:06,683 INFO L87 Difference]: Start difference. First operand has 110 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 105 states have internal predecessors, (106), 3 states have call successors, (3), 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 111 states. [2022-04-28 09:20:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:06,684 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2022-04-28 09:20:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2022-04-28 09:20:06,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:20:06,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:20:06,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:20:06,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:20:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 105 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2022-04-28 09:20:06,685 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2022-04-28 09:20:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:20:06,685 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2022-04-28 09:20:06,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:06,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 110 transitions. [2022-04-28 09:20:06,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:20:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2022-04-28 09:20:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-28 09:20:06,863 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:20:06,863 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:20:06,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-04-28 09:20:07,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:20:07,063 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:20:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:20:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2090870997, now seen corresponding path program 97 times [2022-04-28 09:20:07,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:20:07,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [950765343] [2022-04-28 09:20:07,066 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:20:07,066 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:20:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2090870997, now seen corresponding path program 98 times [2022-04-28 09:20:07,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:20:07,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652032249] [2022-04-28 09:20:07,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:20:07,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:20:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:20:08,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:20:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:20:08,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {43799#(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(14, 2);call #Ultimate.allocInit(12, 3); {43744#true} is VALID [2022-04-28 09:20:08,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {43744#true} assume true; {43744#true} is VALID [2022-04-28 09:20:08,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43744#true} {43744#true} #42#return; {43744#true} is VALID [2022-04-28 09:20:08,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {43744#true} call ULTIMATE.init(); {43799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:20:08,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {43799#(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(14, 2);call #Ultimate.allocInit(12, 3); {43744#true} is VALID [2022-04-28 09:20:08,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {43744#true} assume true; {43744#true} is VALID [2022-04-28 09:20:08,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43744#true} {43744#true} #42#return; {43744#true} is VALID [2022-04-28 09:20:08,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {43744#true} call #t~ret6 := main(); {43744#true} is VALID [2022-04-28 09:20:08,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {43744#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {43749#(= main_~x~0 0)} is VALID [2022-04-28 09:20:08,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {43749#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {43749#(= main_~x~0 0)} is VALID [2022-04-28 09:20:08,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {43749#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43750#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:20:08,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {43750#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {43750#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:20:08,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {43750#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:20:08,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {43751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:20:08,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {43751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43752#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:20:08,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {43752#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {43752#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:20:08,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {43752#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43753#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:20:08,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {43753#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43753#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:20:08,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {43753#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43754#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:20:08,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {43754#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43754#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:20:08,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {43754#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43755#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:20:08,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {43755#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43755#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:20:08,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {43755#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43756#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:20:08,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {43756#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {43756#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:20:08,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {43756#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43757#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:20:08,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {43757#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43757#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:20:08,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {43757#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43758#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:20:08,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {43758#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43758#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:20:08,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {43758#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43759#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:20:08,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {43759#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43759#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:20:08,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {43759#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43760#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:20:08,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {43760#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {43760#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:20:08,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {43760#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43761#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:20:08,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {43761#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43761#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:20:08,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {43761#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:20:08,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {43762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:20:08,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {43762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43763#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:20:08,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {43763#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {43763#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:20:08,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {43763#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43764#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:20:08,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {43764#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {43764#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:20:08,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {43764#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43765#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:20:08,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {43765#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43765#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:20:08,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {43765#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43766#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:20:08,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {43766#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43766#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:20:08,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {43766#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43767#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:20:08,176 INFO L290 TraceCheckUtils]: 42: Hoare triple {43767#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43767#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:20:08,176 INFO L290 TraceCheckUtils]: 43: Hoare triple {43767#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43768#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:20:08,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {43768#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43768#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:20:08,177 INFO L290 TraceCheckUtils]: 45: Hoare triple {43768#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43769#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:20:08,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {43769#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43769#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:20:08,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {43769#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43770#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:20:08,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {43770#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43770#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:20:08,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {43770#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43771#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:20:08,179 INFO L290 TraceCheckUtils]: 50: Hoare triple {43771#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {43771#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:20:08,179 INFO L290 TraceCheckUtils]: 51: Hoare triple {43771#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43772#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:20:08,179 INFO L290 TraceCheckUtils]: 52: Hoare triple {43772#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {43772#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:20:08,180 INFO L290 TraceCheckUtils]: 53: Hoare triple {43772#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43773#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:20:08,180 INFO L290 TraceCheckUtils]: 54: Hoare triple {43773#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43773#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:20:08,180 INFO L290 TraceCheckUtils]: 55: Hoare triple {43773#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43774#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:20:08,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {43774#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43774#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:20:08,181 INFO L290 TraceCheckUtils]: 57: Hoare triple {43774#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43775#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:20:08,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {43775#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43775#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:20:08,182 INFO L290 TraceCheckUtils]: 59: Hoare triple {43775#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43776#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:20:08,182 INFO L290 TraceCheckUtils]: 60: Hoare triple {43776#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43776#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:20:08,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {43776#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43777#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:20:08,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {43777#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43777#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:20:08,183 INFO L290 TraceCheckUtils]: 63: Hoare triple {43777#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43778#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:20:08,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {43778#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {43778#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:20:08,184 INFO L290 TraceCheckUtils]: 65: Hoare triple {43778#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43779#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:20:08,184 INFO L290 TraceCheckUtils]: 66: Hoare triple {43779#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43779#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:20:08,184 INFO L290 TraceCheckUtils]: 67: Hoare triple {43779#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43780#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:20:08,185 INFO L290 TraceCheckUtils]: 68: Hoare triple {43780#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {43780#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:20:08,185 INFO L290 TraceCheckUtils]: 69: Hoare triple {43780#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43781#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:20:08,185 INFO L290 TraceCheckUtils]: 70: Hoare triple {43781#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43781#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:20:08,186 INFO L290 TraceCheckUtils]: 71: Hoare triple {43781#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43782#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:20:08,186 INFO L290 TraceCheckUtils]: 72: Hoare triple {43782#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {43782#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:20:08,186 INFO L290 TraceCheckUtils]: 73: Hoare triple {43782#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43783#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:20:08,187 INFO L290 TraceCheckUtils]: 74: Hoare triple {43783#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43783#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:20:08,187 INFO L290 TraceCheckUtils]: 75: Hoare triple {43783#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43784#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:20:08,187 INFO L290 TraceCheckUtils]: 76: Hoare triple {43784#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43784#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:20:08,188 INFO L290 TraceCheckUtils]: 77: Hoare triple {43784#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43785#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:20:08,188 INFO L290 TraceCheckUtils]: 78: Hoare triple {43785#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {43785#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:20:08,188 INFO L290 TraceCheckUtils]: 79: Hoare triple {43785#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43786#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:20:08,189 INFO L290 TraceCheckUtils]: 80: Hoare triple {43786#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {43786#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:20:08,189 INFO L290 TraceCheckUtils]: 81: Hoare triple {43786#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43787#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:20:08,189 INFO L290 TraceCheckUtils]: 82: Hoare triple {43787#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {43787#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:20:08,190 INFO L290 TraceCheckUtils]: 83: Hoare triple {43787#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43788#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:20:08,190 INFO L290 TraceCheckUtils]: 84: Hoare triple {43788#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {43788#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:20:08,190 INFO L290 TraceCheckUtils]: 85: Hoare triple {43788#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43789#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:20:08,191 INFO L290 TraceCheckUtils]: 86: Hoare triple {43789#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {43789#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:20:08,191 INFO L290 TraceCheckUtils]: 87: Hoare triple {43789#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43790#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:20:08,191 INFO L290 TraceCheckUtils]: 88: Hoare triple {43790#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {43790#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:20:08,192 INFO L290 TraceCheckUtils]: 89: Hoare triple {43790#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43791#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:20:08,192 INFO L290 TraceCheckUtils]: 90: Hoare triple {43791#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 99); {43791#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:20:08,192 INFO L290 TraceCheckUtils]: 91: Hoare triple {43791#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43792#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:20:08,193 INFO L290 TraceCheckUtils]: 92: Hoare triple {43792#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43792#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:20:08,193 INFO L290 TraceCheckUtils]: 93: Hoare triple {43792#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43793#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:20:08,193 INFO L290 TraceCheckUtils]: 94: Hoare triple {43793#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43793#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:20:08,194 INFO L290 TraceCheckUtils]: 95: Hoare triple {43793#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43794#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 09:20:08,194 INFO L290 TraceCheckUtils]: 96: Hoare triple {43794#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 99); {43794#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 09:20:08,194 INFO L290 TraceCheckUtils]: 97: Hoare triple {43794#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43795#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 09:20:08,195 INFO L290 TraceCheckUtils]: 98: Hoare triple {43795#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43795#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 09:20:08,195 INFO L290 TraceCheckUtils]: 99: Hoare triple {43795#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43796#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 09:20:08,195 INFO L290 TraceCheckUtils]: 100: Hoare triple {43796#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 99); {43796#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 09:20:08,196 INFO L290 TraceCheckUtils]: 101: Hoare triple {43796#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43797#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 09:20:08,196 INFO L290 TraceCheckUtils]: 102: Hoare triple {43797#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 99); {43797#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 09:20:08,196 INFO L290 TraceCheckUtils]: 103: Hoare triple {43797#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43798#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 98))} is VALID [2022-04-28 09:20:08,197 INFO L290 TraceCheckUtils]: 104: Hoare triple {43798#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 98))} assume !(~x~0 % 4294967296 < 99); {43745#false} is VALID [2022-04-28 09:20:08,197 INFO L272 TraceCheckUtils]: 105: Hoare triple {43745#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {43745#false} is VALID [2022-04-28 09:20:08,197 INFO L290 TraceCheckUtils]: 106: Hoare triple {43745#false} ~cond := #in~cond; {43745#false} is VALID [2022-04-28 09:20:08,197 INFO L290 TraceCheckUtils]: 107: Hoare triple {43745#false} assume 0 == ~cond; {43745#false} is VALID [2022-04-28 09:20:08,197 INFO L290 TraceCheckUtils]: 108: Hoare triple {43745#false} assume !false; {43745#false} is VALID [2022-04-28 09:20:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:20:08,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:20:08,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652032249] [2022-04-28 09:20:08,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652032249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:20:08,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835461947] [2022-04-28 09:20:08,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:20:08,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:20:08,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:20:08,202 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 09:20:08,203 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 09:20:08,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:20:08,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:20:08,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 101 conjunts are in the unsatisfiable core [2022-04-28 09:20:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:20:08,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:20:09,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {43744#true} call ULTIMATE.init(); {43744#true} is VALID [2022-04-28 09:20:09,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {43744#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(14, 2);call #Ultimate.allocInit(12, 3); {43744#true} is VALID [2022-04-28 09:20:09,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {43744#true} assume true; {43744#true} is VALID [2022-04-28 09:20:09,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43744#true} {43744#true} #42#return; {43744#true} is VALID [2022-04-28 09:20:09,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {43744#true} call #t~ret6 := main(); {43744#true} is VALID [2022-04-28 09:20:09,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {43744#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {43749#(= main_~x~0 0)} is VALID [2022-04-28 09:20:09,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {43749#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {43749#(= main_~x~0 0)} is VALID [2022-04-28 09:20:09,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {43749#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43750#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:20:09,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {43750#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {43750#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:20:09,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {43750#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:20:09,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {43751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:20:09,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {43751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43752#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:20:09,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {43752#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {43752#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 09:20:09,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {43752#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43753#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:20:09,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {43753#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43753#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 09:20:09,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {43753#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43754#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:20:09,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {43754#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43754#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 09:20:09,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {43754#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43755#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:20:09,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {43755#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43755#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 09:20:09,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {43755#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43756#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:20:09,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {43756#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {43756#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 09:20:09,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {43756#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43757#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:20:09,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {43757#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43757#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 09:20:09,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {43757#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43758#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:20:09,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {43758#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43758#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 09:20:09,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {43758#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43759#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:20:09,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {43759#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43759#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 09:20:09,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {43759#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43760#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:20:09,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {43760#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {43760#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 09:20:09,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {43760#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43761#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:20:09,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {43761#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43761#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 09:20:09,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {43761#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:20:09,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {43762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 09:20:09,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {43762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43763#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:20:09,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {43763#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {43763#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 09:20:09,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {43763#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43764#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:20:09,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {43764#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {43764#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 09:20:09,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {43764#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43765#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:20:09,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {43765#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43765#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 09:20:09,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {43765#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43766#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:20:09,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {43766#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43766#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 09:20:09,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {43766#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43767#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:20:09,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {43767#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43767#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 09:20:09,322 INFO L290 TraceCheckUtils]: 43: Hoare triple {43767#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43768#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:20:09,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {43768#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43768#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 09:20:09,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {43768#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43769#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:20:09,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {43769#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43769#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 09:20:09,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {43769#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43770#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:20:09,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {43770#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43770#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 09:20:09,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {43770#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43771#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:20:09,325 INFO L290 TraceCheckUtils]: 50: Hoare triple {43771#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {43771#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 09:20:09,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {43771#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43772#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:20:09,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {43772#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {43772#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 09:20:09,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {43772#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43773#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:20:09,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {43773#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43773#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 09:20:09,327 INFO L290 TraceCheckUtils]: 55: Hoare triple {43773#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43774#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:20:09,327 INFO L290 TraceCheckUtils]: 56: Hoare triple {43774#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43774#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 09:20:09,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {43774#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43775#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:20:09,328 INFO L290 TraceCheckUtils]: 58: Hoare triple {43775#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43775#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 09:20:09,328 INFO L290 TraceCheckUtils]: 59: Hoare triple {43775#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43776#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:20:09,329 INFO L290 TraceCheckUtils]: 60: Hoare triple {43776#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43776#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 09:20:09,329 INFO L290 TraceCheckUtils]: 61: Hoare triple {43776#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43777#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:20:09,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {43777#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43777#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 09:20:09,330 INFO L290 TraceCheckUtils]: 63: Hoare triple {43777#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43778#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:20:09,330 INFO L290 TraceCheckUtils]: 64: Hoare triple {43778#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {43778#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 09:20:09,331 INFO L290 TraceCheckUtils]: 65: Hoare triple {43778#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43779#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:20:09,331 INFO L290 TraceCheckUtils]: 66: Hoare triple {43779#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43779#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 09:20:09,332 INFO L290 TraceCheckUtils]: 67: Hoare triple {43779#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43780#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:20:09,332 INFO L290 TraceCheckUtils]: 68: Hoare triple {43780#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {43780#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 09:20:09,332 INFO L290 TraceCheckUtils]: 69: Hoare triple {43780#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43781#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:20:09,333 INFO L290 TraceCheckUtils]: 70: Hoare triple {43781#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43781#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 09:20:09,333 INFO L290 TraceCheckUtils]: 71: Hoare triple {43781#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43782#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:20:09,333 INFO L290 TraceCheckUtils]: 72: Hoare triple {43782#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {43782#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 09:20:09,334 INFO L290 TraceCheckUtils]: 73: Hoare triple {43782#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43783#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:20:09,334 INFO L290 TraceCheckUtils]: 74: Hoare triple {43783#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43783#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 09:20:09,335 INFO L290 TraceCheckUtils]: 75: Hoare triple {43783#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43784#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:20:09,335 INFO L290 TraceCheckUtils]: 76: Hoare triple {43784#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43784#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 09:20:09,336 INFO L290 TraceCheckUtils]: 77: Hoare triple {43784#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43785#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:20:09,336 INFO L290 TraceCheckUtils]: 78: Hoare triple {43785#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {43785#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 09:20:09,336 INFO L290 TraceCheckUtils]: 79: Hoare triple {43785#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43786#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:20:09,337 INFO L290 TraceCheckUtils]: 80: Hoare triple {43786#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {43786#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 09:20:09,337 INFO L290 TraceCheckUtils]: 81: Hoare triple {43786#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43787#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:20:09,337 INFO L290 TraceCheckUtils]: 82: Hoare triple {43787#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {43787#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 09:20:09,338 INFO L290 TraceCheckUtils]: 83: Hoare triple {43787#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43788#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:20:09,338 INFO L290 TraceCheckUtils]: 84: Hoare triple {43788#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {43788#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 09:20:09,339 INFO L290 TraceCheckUtils]: 85: Hoare triple {43788#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43789#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:20:09,339 INFO L290 TraceCheckUtils]: 86: Hoare triple {43789#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {43789#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 09:20:09,340 INFO L290 TraceCheckUtils]: 87: Hoare triple {43789#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43790#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:20:09,340 INFO L290 TraceCheckUtils]: 88: Hoare triple {43790#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {43790#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 09:20:09,340 INFO L290 TraceCheckUtils]: 89: Hoare triple {43790#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43791#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:20:09,341 INFO L290 TraceCheckUtils]: 90: Hoare triple {43791#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 99); {43791#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 09:20:09,341 INFO L290 TraceCheckUtils]: 91: Hoare triple {43791#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43792#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:20:09,342 INFO L290 TraceCheckUtils]: 92: Hoare triple {43792#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43792#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 09:20:09,342 INFO L290 TraceCheckUtils]: 93: Hoare triple {43792#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43793#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:20:09,342 INFO L290 TraceCheckUtils]: 94: Hoare triple {43793#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43793#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 09:20:09,343 INFO L290 TraceCheckUtils]: 95: Hoare triple {43793#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43794#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 09:20:09,343 INFO L290 TraceCheckUtils]: 96: Hoare triple {43794#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 99); {43794#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 09:20:09,344 INFO L290 TraceCheckUtils]: 97: Hoare triple {43794#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43795#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 09:20:09,344 INFO L290 TraceCheckUtils]: 98: Hoare triple {43795#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {43795#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 09:20:09,344 INFO L290 TraceCheckUtils]: 99: Hoare triple {43795#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43796#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 09:20:09,345 INFO L290 TraceCheckUtils]: 100: Hoare triple {43796#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 99); {43796#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 09:20:09,345 INFO L290 TraceCheckUtils]: 101: Hoare triple {43796#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {43797#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 09:20:09,346 INFO L290 TraceCheckUtils]: 102: Hoare triple {43797#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 99); {43797#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 09:20:09,346 INFO L290 TraceCheckUtils]: 103: Hoare triple {43797#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44112#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 09:20:09,347 INFO L290 TraceCheckUtils]: 104: Hoare triple {44112#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !(~x~0 % 4294967296 < 99); {43745#false} is VALID [2022-04-28 09:20:09,347 INFO L272 TraceCheckUtils]: 105: Hoare triple {43745#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {43745#false} is VALID [2022-04-28 09:20:09,347 INFO L290 TraceCheckUtils]: 106: Hoare triple {43745#false} ~cond := #in~cond; {43745#false} is VALID [2022-04-28 09:20:09,347 INFO L290 TraceCheckUtils]: 107: Hoare triple {43745#false} assume 0 == ~cond; {43745#false} is VALID [2022-04-28 09:20:09,347 INFO L290 TraceCheckUtils]: 108: Hoare triple {43745#false} assume !false; {43745#false} is VALID [2022-04-28 09:20:09,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:20:09,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:20:12,124 INFO L290 TraceCheckUtils]: 108: Hoare triple {43745#false} assume !false; {43745#false} is VALID [2022-04-28 09:20:12,124 INFO L290 TraceCheckUtils]: 107: Hoare triple {43745#false} assume 0 == ~cond; {43745#false} is VALID [2022-04-28 09:20:12,124 INFO L290 TraceCheckUtils]: 106: Hoare triple {43745#false} ~cond := #in~cond; {43745#false} is VALID [2022-04-28 09:20:12,124 INFO L272 TraceCheckUtils]: 105: Hoare triple {43745#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {43745#false} is VALID [2022-04-28 09:20:12,124 INFO L290 TraceCheckUtils]: 104: Hoare triple {44140#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {43745#false} is VALID [2022-04-28 09:20:12,125 INFO L290 TraceCheckUtils]: 103: Hoare triple {44144#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44140#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 09:20:12,125 INFO L290 TraceCheckUtils]: 102: Hoare triple {44144#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44144#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:20:12,126 INFO L290 TraceCheckUtils]: 101: Hoare triple {44151#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44144#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 09:20:12,126 INFO L290 TraceCheckUtils]: 100: Hoare triple {44151#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44151#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:20:12,126 INFO L290 TraceCheckUtils]: 99: Hoare triple {44158#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44151#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-28 09:20:12,126 INFO L290 TraceCheckUtils]: 98: Hoare triple {44158#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44158#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:20:12,127 INFO L290 TraceCheckUtils]: 97: Hoare triple {44165#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44158#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-28 09:20:12,127 INFO L290 TraceCheckUtils]: 96: Hoare triple {44165#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44165#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:20:12,128 INFO L290 TraceCheckUtils]: 95: Hoare triple {44172#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44165#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-28 09:20:12,128 INFO L290 TraceCheckUtils]: 94: Hoare triple {44172#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44172#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:20:12,128 INFO L290 TraceCheckUtils]: 93: Hoare triple {44179#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44172#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-28 09:20:12,129 INFO L290 TraceCheckUtils]: 92: Hoare triple {44179#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44179#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:20:12,129 INFO L290 TraceCheckUtils]: 91: Hoare triple {44186#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44179#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-28 09:20:12,129 INFO L290 TraceCheckUtils]: 90: Hoare triple {44186#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44186#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:20:12,130 INFO L290 TraceCheckUtils]: 89: Hoare triple {44193#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44186#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-28 09:20:12,130 INFO L290 TraceCheckUtils]: 88: Hoare triple {44193#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44193#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:20:12,130 INFO L290 TraceCheckUtils]: 87: Hoare triple {44200#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44193#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-28 09:20:12,131 INFO L290 TraceCheckUtils]: 86: Hoare triple {44200#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44200#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:20:12,131 INFO L290 TraceCheckUtils]: 85: Hoare triple {44207#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44200#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-28 09:20:12,131 INFO L290 TraceCheckUtils]: 84: Hoare triple {44207#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44207#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:20:12,132 INFO L290 TraceCheckUtils]: 83: Hoare triple {44214#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44207#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-28 09:20:12,132 INFO L290 TraceCheckUtils]: 82: Hoare triple {44214#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44214#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:20:12,132 INFO L290 TraceCheckUtils]: 81: Hoare triple {44221#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44214#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-28 09:20:12,133 INFO L290 TraceCheckUtils]: 80: Hoare triple {44221#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44221#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:20:12,133 INFO L290 TraceCheckUtils]: 79: Hoare triple {44228#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44221#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-28 09:20:12,133 INFO L290 TraceCheckUtils]: 78: Hoare triple {44228#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44228#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:20:12,134 INFO L290 TraceCheckUtils]: 77: Hoare triple {44235#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44228#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-28 09:20:12,134 INFO L290 TraceCheckUtils]: 76: Hoare triple {44235#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44235#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-28 09:20:12,134 INFO L290 TraceCheckUtils]: 75: Hoare triple {44242#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44235#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-28 09:20:12,135 INFO L290 TraceCheckUtils]: 74: Hoare triple {44242#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44242#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,135 INFO L290 TraceCheckUtils]: 73: Hoare triple {44249#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44242#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,135 INFO L290 TraceCheckUtils]: 72: Hoare triple {44249#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44249#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,136 INFO L290 TraceCheckUtils]: 71: Hoare triple {44256#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44249#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {44256#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44256#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-28 09:20:12,136 INFO L290 TraceCheckUtils]: 69: Hoare triple {44263#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44256#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-28 09:20:12,137 INFO L290 TraceCheckUtils]: 68: Hoare triple {44263#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44263#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-28 09:20:12,137 INFO L290 TraceCheckUtils]: 67: Hoare triple {44270#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44263#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-28 09:20:12,137 INFO L290 TraceCheckUtils]: 66: Hoare triple {44270#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44270#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-28 09:20:12,138 INFO L290 TraceCheckUtils]: 65: Hoare triple {44277#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44270#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-28 09:20:12,138 INFO L290 TraceCheckUtils]: 64: Hoare triple {44277#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44277#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,138 INFO L290 TraceCheckUtils]: 63: Hoare triple {44284#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44277#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,139 INFO L290 TraceCheckUtils]: 62: Hoare triple {44284#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44284#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {44291#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44284#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {44291#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44291#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,140 INFO L290 TraceCheckUtils]: 59: Hoare triple {44298#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44291#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,140 INFO L290 TraceCheckUtils]: 58: Hoare triple {44298#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44298#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-28 09:20:12,140 INFO L290 TraceCheckUtils]: 57: Hoare triple {44305#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44298#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-28 09:20:12,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {44305#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44305#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-28 09:20:12,141 INFO L290 TraceCheckUtils]: 55: Hoare triple {44312#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44305#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-28 09:20:12,141 INFO L290 TraceCheckUtils]: 54: Hoare triple {44312#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44312#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-28 09:20:12,142 INFO L290 TraceCheckUtils]: 53: Hoare triple {44319#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44312#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-28 09:20:12,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {44319#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44319#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-28 09:20:12,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {44326#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44319#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-28 09:20:12,143 INFO L290 TraceCheckUtils]: 50: Hoare triple {44326#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44326#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-28 09:20:12,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {44333#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44326#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-28 09:20:12,143 INFO L290 TraceCheckUtils]: 48: Hoare triple {44333#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44333#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {44340#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44333#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {44340#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44340#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-28 09:20:12,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {44347#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44340#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-28 09:20:12,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {44347#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44347#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-28 09:20:12,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {44354#(< (mod (+ main_~x~0 62) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44347#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-28 09:20:12,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {44354#(< (mod (+ main_~x~0 62) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44354#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-28 09:20:12,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {44361#(< (mod (+ 64 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44354#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-28 09:20:12,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {44361#(< (mod (+ 64 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44361#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {44368#(< (mod (+ 66 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44361#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {44368#(< (mod (+ 66 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44368#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {44375#(< (mod (+ 68 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44368#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {44375#(< (mod (+ 68 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44375#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {44382#(< (mod (+ main_~x~0 70) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44375#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {44382#(< (mod (+ main_~x~0 70) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44382#(< (mod (+ main_~x~0 70) 4294967296) 99)} is VALID [2022-04-28 09:20:12,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {44389#(< (mod (+ 72 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44382#(< (mod (+ main_~x~0 70) 4294967296) 99)} is VALID [2022-04-28 09:20:12,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {44389#(< (mod (+ 72 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44389#(< (mod (+ 72 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {44396#(< (mod (+ main_~x~0 74) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44389#(< (mod (+ 72 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {44396#(< (mod (+ main_~x~0 74) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44396#(< (mod (+ main_~x~0 74) 4294967296) 99)} is VALID [2022-04-28 09:20:12,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {44403#(< (mod (+ 76 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44396#(< (mod (+ main_~x~0 74) 4294967296) 99)} is VALID [2022-04-28 09:20:12,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {44403#(< (mod (+ 76 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44403#(< (mod (+ 76 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {44410#(< (mod (+ main_~x~0 78) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44403#(< (mod (+ 76 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {44410#(< (mod (+ main_~x~0 78) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44410#(< (mod (+ main_~x~0 78) 4294967296) 99)} is VALID [2022-04-28 09:20:12,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {44417#(< (mod (+ main_~x~0 80) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44410#(< (mod (+ main_~x~0 78) 4294967296) 99)} is VALID [2022-04-28 09:20:12,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {44417#(< (mod (+ main_~x~0 80) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44417#(< (mod (+ main_~x~0 80) 4294967296) 99)} is VALID [2022-04-28 09:20:12,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {44424#(< (mod (+ main_~x~0 82) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44417#(< (mod (+ main_~x~0 80) 4294967296) 99)} is VALID [2022-04-28 09:20:12,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {44424#(< (mod (+ main_~x~0 82) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44424#(< (mod (+ main_~x~0 82) 4294967296) 99)} is VALID [2022-04-28 09:20:12,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {44431#(< (mod (+ 84 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44424#(< (mod (+ main_~x~0 82) 4294967296) 99)} is VALID [2022-04-28 09:20:12,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {44431#(< (mod (+ 84 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44431#(< (mod (+ 84 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {44438#(< (mod (+ main_~x~0 86) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44431#(< (mod (+ 84 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {44438#(< (mod (+ main_~x~0 86) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44438#(< (mod (+ main_~x~0 86) 4294967296) 99)} is VALID [2022-04-28 09:20:12,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {44445#(< (mod (+ 88 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44438#(< (mod (+ main_~x~0 86) 4294967296) 99)} is VALID [2022-04-28 09:20:12,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {44445#(< (mod (+ 88 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44445#(< (mod (+ 88 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {44452#(< (mod (+ main_~x~0 90) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44445#(< (mod (+ 88 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {44452#(< (mod (+ main_~x~0 90) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44452#(< (mod (+ main_~x~0 90) 4294967296) 99)} is VALID [2022-04-28 09:20:12,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {44459#(< (mod (+ 92 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44452#(< (mod (+ main_~x~0 90) 4294967296) 99)} is VALID [2022-04-28 09:20:12,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {44459#(< (mod (+ 92 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44459#(< (mod (+ 92 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {44466#(< (mod (+ 94 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44459#(< (mod (+ 92 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {44466#(< (mod (+ 94 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44466#(< (mod (+ 94 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {44473#(< (mod (+ main_~x~0 96) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44466#(< (mod (+ 94 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {44473#(< (mod (+ main_~x~0 96) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44473#(< (mod (+ main_~x~0 96) 4294967296) 99)} is VALID [2022-04-28 09:20:12,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {44480#(< (mod (+ 98 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {44473#(< (mod (+ main_~x~0 96) 4294967296) 99)} is VALID [2022-04-28 09:20:12,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {44480#(< (mod (+ 98 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {44480#(< (mod (+ 98 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {43744#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {44480#(< (mod (+ 98 main_~x~0) 4294967296) 99)} is VALID [2022-04-28 09:20:12,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {43744#true} call #t~ret6 := main(); {43744#true} is VALID [2022-04-28 09:20:12,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43744#true} {43744#true} #42#return; {43744#true} is VALID [2022-04-28 09:20:12,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {43744#true} assume true; {43744#true} is VALID [2022-04-28 09:20:12,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {43744#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(14, 2);call #Ultimate.allocInit(12, 3); {43744#true} is VALID [2022-04-28 09:20:12,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {43744#true} call ULTIMATE.init(); {43744#true} is VALID [2022-04-28 09:20:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:20:12,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835461947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:20:12,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:20:12,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-28 09:20:12,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:20:12,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [950765343] [2022-04-28 09:20:12,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [950765343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:20:12,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:20:12,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 09:20:12,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831895635] [2022-04-28 09:20:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:20:12,167 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 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 109 [2022-04-28 09:20:12,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:20:12,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:12,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:20:12,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 09:20:12,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:20:12,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 09:20:12,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1531, Invalid=9181, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 09:20:12,221 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:19,067 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2022-04-28 09:20:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 09:20:19,068 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 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 109 [2022-04-28 09:20:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:20:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 118 transitions. [2022-04-28 09:20:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 118 transitions. [2022-04-28 09:20:19,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 118 transitions. [2022-04-28 09:20:19,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:20:19,128 INFO L225 Difference]: With dead ends: 118 [2022-04-28 09:20:19,128 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 09:20:19,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2553 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3104, Invalid=20458, Unknown=0, NotChecked=0, Total=23562 [2022-04-28 09:20:19,130 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 107 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 5094 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 5195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 5094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 09:20:19,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 253 Invalid, 5195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 5094 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 09:20:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 09:20:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2022-04-28 09:20:19,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:20:19,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 112 states, 107 states have (on average 1.0093457943925233) internal successors, (108), 107 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:19,774 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 112 states, 107 states have (on average 1.0093457943925233) internal successors, (108), 107 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:19,774 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 112 states, 107 states have (on average 1.0093457943925233) internal successors, (108), 107 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:19,775 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2022-04-28 09:20:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2022-04-28 09:20:19,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:20:19,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:20:19,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 107 states have (on average 1.0093457943925233) internal successors, (108), 107 states have internal predecessors, (108), 3 states have call successors, (3), 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 113 states. [2022-04-28 09:20:19,776 INFO L87 Difference]: Start difference. First operand has 112 states, 107 states have (on average 1.0093457943925233) internal successors, (108), 107 states have internal predecessors, (108), 3 states have call successors, (3), 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 113 states. [2022-04-28 09:20:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:19,777 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2022-04-28 09:20:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2022-04-28 09:20:19,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:20:19,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:20:19,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:20:19,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:20:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0093457943925233) internal successors, (108), 107 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2022-04-28 09:20:19,778 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2022-04-28 09:20:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:20:19,778 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2022-04-28 09:20:19,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:20:19,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 112 transitions. [2022-04-28 09:20:19,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:20:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2022-04-28 09:20:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 09:20:19,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:20:19,958 INFO L195 NwaCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:20:19,976 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 09:20:20,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:20:20,158 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:20:20,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:20:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash 324299794, now seen corresponding path program 99 times [2022-04-28 09:20:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:20:20,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [698765110] [2022-04-28 09:20:20,163 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:20:20,164 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:20:20,164 INFO L85 PathProgramCache]: Analyzing trace with hash 324299794, now seen corresponding path program 100 times [2022-04-28 09:20:20,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:20:20,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325252352] [2022-04-28 09:20:20,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:20:20,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:20:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:20:20,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:20:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:20:20,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {45300#(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(14, 2);call #Ultimate.allocInit(12, 3); {45290#true} is VALID [2022-04-28 09:20:20,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {45290#true} assume true; {45290#true} is VALID [2022-04-28 09:20:20,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45290#true} {45290#true} #42#return; {45290#true} is VALID [2022-04-28 09:20:20,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {45290#true} call ULTIMATE.init(); {45300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:20:20,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {45300#(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(14, 2);call #Ultimate.allocInit(12, 3); {45290#true} is VALID [2022-04-28 09:20:20,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {45290#true} assume true; {45290#true} is VALID [2022-04-28 09:20:20,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45290#true} {45290#true} #42#return; {45290#true} is VALID [2022-04-28 09:20:20,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {45290#true} call #t~ret6 := main(); {45290#true} is VALID [2022-04-28 09:20:20,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {45290#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {45295#(= main_~x~0 0)} is VALID [2022-04-28 09:20:20,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {45295#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {45295#(= main_~x~0 0)} is VALID [2022-04-28 09:20:20,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {45295#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,836 INFO L290 TraceCheckUtils]: 40: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,840 INFO L290 TraceCheckUtils]: 47: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,841 INFO L290 TraceCheckUtils]: 48: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,841 INFO L290 TraceCheckUtils]: 49: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,842 INFO L290 TraceCheckUtils]: 50: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,843 INFO L290 TraceCheckUtils]: 51: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,843 INFO L290 TraceCheckUtils]: 52: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,844 INFO L290 TraceCheckUtils]: 53: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,844 INFO L290 TraceCheckUtils]: 54: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,845 INFO L290 TraceCheckUtils]: 55: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,845 INFO L290 TraceCheckUtils]: 56: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,848 INFO L290 TraceCheckUtils]: 59: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,849 INFO L290 TraceCheckUtils]: 61: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,849 INFO L290 TraceCheckUtils]: 62: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,850 INFO L290 TraceCheckUtils]: 63: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,850 INFO L290 TraceCheckUtils]: 64: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,851 INFO L290 TraceCheckUtils]: 65: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,852 INFO L290 TraceCheckUtils]: 66: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,852 INFO L290 TraceCheckUtils]: 67: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,853 INFO L290 TraceCheckUtils]: 68: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,853 INFO L290 TraceCheckUtils]: 69: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,854 INFO L290 TraceCheckUtils]: 70: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,855 INFO L290 TraceCheckUtils]: 71: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,855 INFO L290 TraceCheckUtils]: 72: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,856 INFO L290 TraceCheckUtils]: 73: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,856 INFO L290 TraceCheckUtils]: 74: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,857 INFO L290 TraceCheckUtils]: 75: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,857 INFO L290 TraceCheckUtils]: 76: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,858 INFO L290 TraceCheckUtils]: 77: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,858 INFO L290 TraceCheckUtils]: 78: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,859 INFO L290 TraceCheckUtils]: 79: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,860 INFO L290 TraceCheckUtils]: 80: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,860 INFO L290 TraceCheckUtils]: 81: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,861 INFO L290 TraceCheckUtils]: 82: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,861 INFO L290 TraceCheckUtils]: 83: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,862 INFO L290 TraceCheckUtils]: 84: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,863 INFO L290 TraceCheckUtils]: 85: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,863 INFO L290 TraceCheckUtils]: 86: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,864 INFO L290 TraceCheckUtils]: 87: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,864 INFO L290 TraceCheckUtils]: 88: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,865 INFO L290 TraceCheckUtils]: 89: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,865 INFO L290 TraceCheckUtils]: 90: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,866 INFO L290 TraceCheckUtils]: 91: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,866 INFO L290 TraceCheckUtils]: 92: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,867 INFO L290 TraceCheckUtils]: 93: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,868 INFO L290 TraceCheckUtils]: 94: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,868 INFO L290 TraceCheckUtils]: 95: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,869 INFO L290 TraceCheckUtils]: 96: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,870 INFO L290 TraceCheckUtils]: 97: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,870 INFO L290 TraceCheckUtils]: 98: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,871 INFO L290 TraceCheckUtils]: 99: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,871 INFO L290 TraceCheckUtils]: 100: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,872 INFO L290 TraceCheckUtils]: 101: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,872 INFO L290 TraceCheckUtils]: 102: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,873 INFO L290 TraceCheckUtils]: 103: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,873 INFO L290 TraceCheckUtils]: 104: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-28 09:20:20,874 INFO L290 TraceCheckUtils]: 105: Hoare triple {45296#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:20,875 INFO L290 TraceCheckUtils]: 106: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:20,876 INFO L272 TraceCheckUtils]: 107: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {45298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:20:20,876 INFO L290 TraceCheckUtils]: 108: Hoare triple {45298#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {45299#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:20:20,876 INFO L290 TraceCheckUtils]: 109: Hoare triple {45299#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {45291#false} is VALID [2022-04-28 09:20:20,876 INFO L290 TraceCheckUtils]: 110: Hoare triple {45291#false} assume !false; {45291#false} is VALID [2022-04-28 09:20:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2022-04-28 09:20:20,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:20:20,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325252352] [2022-04-28 09:20:20,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325252352] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:20:20,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386894375] [2022-04-28 09:20:20,877 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:20:20,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:20:20,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:20:20,878 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 09:20:20,918 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 09:20:20,950 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:20:20,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:20:20,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 106 conjunts are in the unsatisfiable core [2022-04-28 09:20:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:20:20,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:20:23,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {45290#true} call ULTIMATE.init(); {45290#true} is VALID [2022-04-28 09:20:23,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {45290#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(14, 2);call #Ultimate.allocInit(12, 3); {45290#true} is VALID [2022-04-28 09:20:23,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {45290#true} assume true; {45290#true} is VALID [2022-04-28 09:20:23,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45290#true} {45290#true} #42#return; {45290#true} is VALID [2022-04-28 09:20:23,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {45290#true} call #t~ret6 := main(); {45290#true} is VALID [2022-04-28 09:20:23,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {45290#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {45295#(= main_~x~0 0)} is VALID [2022-04-28 09:20:23,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {45295#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {45295#(= main_~x~0 0)} is VALID [2022-04-28 09:20:23,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {45295#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45325#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {45325#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45325#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {45325#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45332#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-28 09:20:23,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {45332#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {45332#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-28 09:20:23,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {45332#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45339#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:20:23,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {45339#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {45339#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} is VALID [2022-04-28 09:20:23,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {45339#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45346#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {45346#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45346#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {45346#(and (= 6 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45353#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:20:23,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {45353#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < 99); {45353#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:20:23,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {45353#(and (<= (mod main_~y~0 2) 0) (= 6 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45360#(and (= 6 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {45360#(and (= 6 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45360#(and (= 6 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {45360#(and (= 6 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45367#(and (= 6 (+ main_~x~0 (- 8))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {45367#(and (= 6 (+ main_~x~0 (- 8))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45367#(and (= 6 (+ main_~x~0 (- 8))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {45367#(and (= 6 (+ main_~x~0 (- 8))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45374#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-28 09:20:23,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {45374#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume !!(~x~0 % 4294967296 < 99); {45374#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-28 09:20:23,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {45374#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45381#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {45381#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45381#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {45381#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45388#(and (= 18 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {45388#(and (= 18 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45388#(and (= 18 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {45388#(and (= 18 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45395#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {45395#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45395#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {45395#(and (= main_~x~0 22) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45402#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {45402#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45402#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {45402#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45409#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 24))} is VALID [2022-04-28 09:20:23,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {45409#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 24))} assume !!(~x~0 % 4294967296 < 99); {45409#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 24))} is VALID [2022-04-28 09:20:23,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {45409#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 24))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45416#(and (= (+ main_~x~0 (- 4)) 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {45416#(and (= (+ main_~x~0 (- 4)) 24) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45416#(and (= (+ main_~x~0 (- 4)) 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {45416#(and (= (+ main_~x~0 (- 4)) 24) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45423#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:20:23,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {45423#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {45423#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} is VALID [2022-04-28 09:20:23,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {45423#(and (<= (mod main_~y~0 2) 0) (= 30 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45430#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:20:23,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {45430#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {45430#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-28 09:20:23,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {45430#(and (<= (mod main_~y~0 2) 0) (= 30 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45437#(and (<= (mod main_~y~0 2) 0) (= 30 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:20:23,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {45437#(and (<= (mod main_~y~0 2) 0) (= 30 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < 99); {45437#(and (<= (mod main_~y~0 2) 0) (= 30 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:20:23,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {45437#(and (<= (mod main_~y~0 2) 0) (= 30 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45444#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:20:23,109 INFO L290 TraceCheckUtils]: 42: Hoare triple {45444#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume !!(~x~0 % 4294967296 < 99); {45444#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-28 09:20:23,109 INFO L290 TraceCheckUtils]: 43: Hoare triple {45444#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45451#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {45451#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45451#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,110 INFO L290 TraceCheckUtils]: 45: Hoare triple {45451#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45458#(and (= (+ main_~x~0 (- 4)) 36) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,110 INFO L290 TraceCheckUtils]: 46: Hoare triple {45458#(and (= (+ main_~x~0 (- 4)) 36) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45458#(and (= (+ main_~x~0 (- 4)) 36) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {45458#(and (= (+ main_~x~0 (- 4)) 36) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45465#(and (= 36 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {45465#(and (= 36 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45465#(and (= 36 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {45465#(and (= 36 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45472#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {45472#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45472#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {45472#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45479#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:20:23,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {45479#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {45479#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} is VALID [2022-04-28 09:20:23,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {45479#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45486#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} is VALID [2022-04-28 09:20:23,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {45486#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} assume !!(~x~0 % 4294967296 < 99); {45486#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} is VALID [2022-04-28 09:20:23,113 INFO L290 TraceCheckUtils]: 55: Hoare triple {45486#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 48))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45493#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {45493#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45493#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {45493#(and (= main_~x~0 50) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45500#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {45500#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45500#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {45500#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45507#(and (= 52 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {45507#(and (= 52 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45507#(and (= 52 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {45507#(and (= 52 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45514#(and (<= (mod main_~y~0 2) 0) (= 56 main_~x~0))} is VALID [2022-04-28 09:20:23,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {45514#(and (<= (mod main_~y~0 2) 0) (= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {45514#(and (<= (mod main_~y~0 2) 0) (= 56 main_~x~0))} is VALID [2022-04-28 09:20:23,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {45514#(and (<= (mod main_~y~0 2) 0) (= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45521#(and (= 56 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {45521#(and (= 56 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45521#(and (= 56 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {45521#(and (= 56 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45528#(and (= 56 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {45528#(and (= 56 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45528#(and (= 56 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,118 INFO L290 TraceCheckUtils]: 67: Hoare triple {45528#(and (= 56 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45535#(and (= main_~x~0 62) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {45535#(and (= main_~x~0 62) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45535#(and (= main_~x~0 62) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,118 INFO L290 TraceCheckUtils]: 69: Hoare triple {45535#(and (= main_~x~0 62) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45542#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} is VALID [2022-04-28 09:20:23,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {45542#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {45542#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} is VALID [2022-04-28 09:20:23,119 INFO L290 TraceCheckUtils]: 71: Hoare triple {45542#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45549#(and (= 64 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,119 INFO L290 TraceCheckUtils]: 72: Hoare triple {45549#(and (= 64 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45549#(and (= 64 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,120 INFO L290 TraceCheckUtils]: 73: Hoare triple {45549#(and (= 64 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45556#(and (<= (mod main_~y~0 2) 0) (= 64 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:20:23,120 INFO L290 TraceCheckUtils]: 74: Hoare triple {45556#(and (<= (mod main_~y~0 2) 0) (= 64 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < 99); {45556#(and (<= (mod main_~y~0 2) 0) (= 64 (+ main_~x~0 (- 4))))} is VALID [2022-04-28 09:20:23,120 INFO L290 TraceCheckUtils]: 75: Hoare triple {45556#(and (<= (mod main_~y~0 2) 0) (= 64 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45563#(and (= 64 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,121 INFO L290 TraceCheckUtils]: 76: Hoare triple {45563#(and (= 64 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45563#(and (= 64 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,121 INFO L290 TraceCheckUtils]: 77: Hoare triple {45563#(and (= 64 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45570#(and (<= (mod main_~y~0 2) 0) (= 64 (+ main_~x~0 (- 8))))} is VALID [2022-04-28 09:20:23,122 INFO L290 TraceCheckUtils]: 78: Hoare triple {45570#(and (<= (mod main_~y~0 2) 0) (= 64 (+ main_~x~0 (- 8))))} assume !!(~x~0 % 4294967296 < 99); {45570#(and (<= (mod main_~y~0 2) 0) (= 64 (+ main_~x~0 (- 8))))} is VALID [2022-04-28 09:20:23,122 INFO L290 TraceCheckUtils]: 79: Hoare triple {45570#(and (<= (mod main_~y~0 2) 0) (= 64 (+ main_~x~0 (- 8))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45577#(and (= (+ main_~x~0 (- 10)) 64) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {45577#(and (= (+ main_~x~0 (- 10)) 64) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45577#(and (= (+ main_~x~0 (- 10)) 64) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,123 INFO L290 TraceCheckUtils]: 81: Hoare triple {45577#(and (= (+ main_~x~0 (- 10)) 64) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45584#(and (<= (mod main_~y~0 2) 0) (= 64 (+ main_~x~0 (- 12))))} is VALID [2022-04-28 09:20:23,123 INFO L290 TraceCheckUtils]: 82: Hoare triple {45584#(and (<= (mod main_~y~0 2) 0) (= 64 (+ main_~x~0 (- 12))))} assume !!(~x~0 % 4294967296 < 99); {45584#(and (<= (mod main_~y~0 2) 0) (= 64 (+ main_~x~0 (- 12))))} is VALID [2022-04-28 09:20:23,123 INFO L290 TraceCheckUtils]: 83: Hoare triple {45584#(and (<= (mod main_~y~0 2) 0) (= 64 (+ main_~x~0 (- 12))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45591#(and (<= (mod main_~y~0 2) 0) (= 64 (+ (- 14) main_~x~0)))} is VALID [2022-04-28 09:20:23,124 INFO L290 TraceCheckUtils]: 84: Hoare triple {45591#(and (<= (mod main_~y~0 2) 0) (= 64 (+ (- 14) main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {45591#(and (<= (mod main_~y~0 2) 0) (= 64 (+ (- 14) main_~x~0)))} is VALID [2022-04-28 09:20:23,124 INFO L290 TraceCheckUtils]: 85: Hoare triple {45591#(and (<= (mod main_~y~0 2) 0) (= 64 (+ (- 14) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45598#(and (= 64 (+ (- 16) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,125 INFO L290 TraceCheckUtils]: 86: Hoare triple {45598#(and (= 64 (+ (- 16) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45598#(and (= 64 (+ (- 16) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,125 INFO L290 TraceCheckUtils]: 87: Hoare triple {45598#(and (= 64 (+ (- 16) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45605#(and (= (+ main_~x~0 (- 18)) 64) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,125 INFO L290 TraceCheckUtils]: 88: Hoare triple {45605#(and (= (+ main_~x~0 (- 18)) 64) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45605#(and (= (+ main_~x~0 (- 18)) 64) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,126 INFO L290 TraceCheckUtils]: 89: Hoare triple {45605#(and (= (+ main_~x~0 (- 18)) 64) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45612#(and (<= (mod main_~y~0 2) 0) (= 84 main_~x~0))} is VALID [2022-04-28 09:20:23,126 INFO L290 TraceCheckUtils]: 90: Hoare triple {45612#(and (<= (mod main_~y~0 2) 0) (= 84 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {45612#(and (<= (mod main_~y~0 2) 0) (= 84 main_~x~0))} is VALID [2022-04-28 09:20:23,126 INFO L290 TraceCheckUtils]: 91: Hoare triple {45612#(and (<= (mod main_~y~0 2) 0) (= 84 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45619#(and (= main_~x~0 86) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,127 INFO L290 TraceCheckUtils]: 92: Hoare triple {45619#(and (= main_~x~0 86) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45619#(and (= main_~x~0 86) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,127 INFO L290 TraceCheckUtils]: 93: Hoare triple {45619#(and (= main_~x~0 86) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45626#(and (= (+ (- 2) main_~x~0) 86) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,127 INFO L290 TraceCheckUtils]: 94: Hoare triple {45626#(and (= (+ (- 2) main_~x~0) 86) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45626#(and (= (+ (- 2) main_~x~0) 86) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,128 INFO L290 TraceCheckUtils]: 95: Hoare triple {45626#(and (= (+ (- 2) main_~x~0) 86) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45633#(and (= main_~x~0 90) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,128 INFO L290 TraceCheckUtils]: 96: Hoare triple {45633#(and (= main_~x~0 90) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45633#(and (= main_~x~0 90) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,128 INFO L290 TraceCheckUtils]: 97: Hoare triple {45633#(and (= main_~x~0 90) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45640#(and (= 90 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,129 INFO L290 TraceCheckUtils]: 98: Hoare triple {45640#(and (= 90 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45640#(and (= 90 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,129 INFO L290 TraceCheckUtils]: 99: Hoare triple {45640#(and (= 90 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45647#(and (<= (mod main_~y~0 2) 0) (= 94 main_~x~0))} is VALID [2022-04-28 09:20:23,130 INFO L290 TraceCheckUtils]: 100: Hoare triple {45647#(and (<= (mod main_~y~0 2) 0) (= 94 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {45647#(and (<= (mod main_~y~0 2) 0) (= 94 main_~x~0))} is VALID [2022-04-28 09:20:23,130 INFO L290 TraceCheckUtils]: 101: Hoare triple {45647#(and (<= (mod main_~y~0 2) 0) (= 94 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45654#(and (= main_~x~0 96) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,130 INFO L290 TraceCheckUtils]: 102: Hoare triple {45654#(and (= main_~x~0 96) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45654#(and (= main_~x~0 96) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,131 INFO L290 TraceCheckUtils]: 103: Hoare triple {45654#(and (= main_~x~0 96) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45661#(and (= 98 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,131 INFO L290 TraceCheckUtils]: 104: Hoare triple {45661#(and (= 98 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {45661#(and (= 98 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,131 INFO L290 TraceCheckUtils]: 105: Hoare triple {45661#(and (= 98 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45668#(and (= 98 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,132 INFO L290 TraceCheckUtils]: 106: Hoare triple {45668#(and (= 98 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {45668#(and (= 98 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-28 09:20:23,132 INFO L272 TraceCheckUtils]: 107: Hoare triple {45668#(and (= 98 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {45675#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:20:23,133 INFO L290 TraceCheckUtils]: 108: Hoare triple {45675#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45679#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:20:23,133 INFO L290 TraceCheckUtils]: 109: Hoare triple {45679#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {45291#false} is VALID [2022-04-28 09:20:23,133 INFO L290 TraceCheckUtils]: 110: Hoare triple {45291#false} assume !false; {45291#false} is VALID [2022-04-28 09:20:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:20:23,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:20:24,532 INFO L290 TraceCheckUtils]: 110: Hoare triple {45291#false} assume !false; {45291#false} is VALID [2022-04-28 09:20:24,532 INFO L290 TraceCheckUtils]: 109: Hoare triple {45679#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {45291#false} is VALID [2022-04-28 09:20:24,533 INFO L290 TraceCheckUtils]: 108: Hoare triple {45675#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45679#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:20:24,533 INFO L272 TraceCheckUtils]: 107: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {45675#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:20:24,534 INFO L290 TraceCheckUtils]: 106: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,535 INFO L290 TraceCheckUtils]: 105: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,535 INFO L290 TraceCheckUtils]: 104: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,536 INFO L290 TraceCheckUtils]: 103: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,536 INFO L290 TraceCheckUtils]: 102: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,537 INFO L290 TraceCheckUtils]: 101: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,538 INFO L290 TraceCheckUtils]: 100: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,538 INFO L290 TraceCheckUtils]: 99: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,539 INFO L290 TraceCheckUtils]: 98: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,539 INFO L290 TraceCheckUtils]: 97: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,540 INFO L290 TraceCheckUtils]: 96: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,541 INFO L290 TraceCheckUtils]: 95: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,541 INFO L290 TraceCheckUtils]: 94: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,542 INFO L290 TraceCheckUtils]: 93: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,542 INFO L290 TraceCheckUtils]: 92: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,543 INFO L290 TraceCheckUtils]: 91: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,543 INFO L290 TraceCheckUtils]: 90: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,544 INFO L290 TraceCheckUtils]: 89: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,545 INFO L290 TraceCheckUtils]: 88: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,545 INFO L290 TraceCheckUtils]: 87: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,546 INFO L290 TraceCheckUtils]: 86: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,546 INFO L290 TraceCheckUtils]: 85: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,547 INFO L290 TraceCheckUtils]: 84: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,548 INFO L290 TraceCheckUtils]: 83: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,548 INFO L290 TraceCheckUtils]: 82: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,549 INFO L290 TraceCheckUtils]: 81: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,549 INFO L290 TraceCheckUtils]: 80: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,550 INFO L290 TraceCheckUtils]: 79: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,550 INFO L290 TraceCheckUtils]: 78: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,551 INFO L290 TraceCheckUtils]: 77: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,551 INFO L290 TraceCheckUtils]: 76: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,552 INFO L290 TraceCheckUtils]: 75: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,553 INFO L290 TraceCheckUtils]: 74: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,554 INFO L290 TraceCheckUtils]: 72: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,554 INFO L290 TraceCheckUtils]: 71: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,555 INFO L290 TraceCheckUtils]: 70: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,556 INFO L290 TraceCheckUtils]: 69: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,556 INFO L290 TraceCheckUtils]: 68: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,557 INFO L290 TraceCheckUtils]: 67: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,557 INFO L290 TraceCheckUtils]: 66: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,558 INFO L290 TraceCheckUtils]: 64: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,559 INFO L290 TraceCheckUtils]: 63: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,559 INFO L290 TraceCheckUtils]: 62: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,560 INFO L290 TraceCheckUtils]: 61: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,561 INFO L290 TraceCheckUtils]: 60: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,563 INFO L290 TraceCheckUtils]: 57: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,564 INFO L290 TraceCheckUtils]: 55: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,564 INFO L290 TraceCheckUtils]: 54: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,565 INFO L290 TraceCheckUtils]: 53: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,566 INFO L290 TraceCheckUtils]: 51: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,568 INFO L290 TraceCheckUtils]: 47: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,571 INFO L290 TraceCheckUtils]: 43: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {45995#(< 0 (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) (div (+ main_~x~0 2) 2) 1))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {45297#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-28 09:20:24,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {45995#(< 0 (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) (div (+ main_~x~0 2) 2) 1))} assume !!(~x~0 % 4294967296 < 99); {45995#(< 0 (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) (div (+ main_~x~0 2) 2) 1))} is VALID [2022-04-28 09:20:24,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {45290#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {45995#(< 0 (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) (div (+ main_~x~0 2) 2) 1))} is VALID [2022-04-28 09:20:24,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {45290#true} call #t~ret6 := main(); {45290#true} is VALID [2022-04-28 09:20:24,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45290#true} {45290#true} #42#return; {45290#true} is VALID [2022-04-28 09:20:24,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {45290#true} assume true; {45290#true} is VALID [2022-04-28 09:20:24,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {45290#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(14, 2);call #Ultimate.allocInit(12, 3); {45290#true} is VALID [2022-04-28 09:20:24,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {45290#true} call ULTIMATE.init(); {45290#true} is VALID [2022-04-28 09:20:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 2401 trivial. 0 not checked. [2022-04-28 09:20:24,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386894375] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:20:24,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:20:24,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 55, 6] total 61 [2022-04-28 09:20:24,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:20:24,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [698765110] [2022-04-28 09:20:24,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [698765110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:20:24,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:20:24,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:20:24,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382227494] [2022-04-28 09:20:24,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:20:24,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 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 111 [2022-04-28 09:20:24,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:20:24,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 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 09:20:24,605 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 09:20:24,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:20:24,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:20:24,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:20:24,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=3386, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 09:20:24,606 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 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 09:20:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:25,190 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-04-28 09:20:25,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:20:25,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 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 111 [2022-04-28 09:20:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:20:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 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 09:20:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2022-04-28 09:20:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 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 09:20:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2022-04-28 09:20:25,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2022-04-28 09:20:25,199 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 09:20:25,199 INFO L225 Difference]: With dead ends: 112 [2022-04-28 09:20:25,199 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:20:25,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 120 SyntacticMatches, 99 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=295, Invalid=3865, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 09:20:25,201 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:20:25,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 34 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:20:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:20:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:20:25,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:20:25,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:20:25,202 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:20:25,202 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:20:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:25,202 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:20:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:20:25,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:20:25,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:20:25,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:20:25,202 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:20:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:20:25,203 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:20:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:20:25,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:20:25,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:20:25,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:20:25,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:20:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:20:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:20:25,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2022-04-28 09:20:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:20:25,203 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:20:25,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 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 09:20:25,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:20:25,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:20:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:20:25,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:20:25,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:20:25,250 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 09:20:25,423 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,SelfDestructingSolverStorable59 [2022-04-28 09:20:25,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.